Fast Algorithm for the Rainbow Disconnection Coloring of 2-Trees
- 17 July 2023
- journal article
- research article
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 14 (1) , 149-161
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Basic Research Program of Shaanxi Province (2022JQ-009)
- Natural Science Basic Research Program of Shaanxi Province (2023-JC-YB-001)
- Innovative Research Group Project of the National Natural Science Foundation of China (XJS220705)
- National Natural Science Foundation of China (12071370)
- National Natural Science Foundation of China (2023-JC-YB-054)
This publication has 14 references indexed in Scilit:
- An Updated Survey on Rainbow Connections of Graphs- A Dynamic SurveyTheory and Applications of Graphs, 2017
- Rainbow Connections of Graphs: A SurveyGraphs and Combinatorics, 2012
- Rainbow Connections of Graphs2012
- Networks in Aviation2010
- Graph Theory2008
- Transportation Network Analysis1997
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- A note on the maximum flow through a networkIEEE Transactions on Information Theory, 1956
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956