BOOK-CHAPTER
Completely Independent Spanning Trees in Maximal Planar Graphs
Year: 2002 Lecture notes in computer science Pages: 235-245 Publisher: Springer Science+Business Media
Keywords:
Spanning tree Combinatorics Trémaux tree Minimum spanning tree Minimum degree spanning tree Shortest-path tree Pairwise comparison Planar graph Mathematics Graph Disjoint sets Discrete mathematics Time complexity Line graph Pathwidth
Metrics
74
Cited By
0.00
FWCI (Field Weighted Citation Impact)
24
Refs
0.19
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Computational Geometry and Mesh Generation
Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design
Optimization and Search Problems
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
Completely Independent Spanning Trees in Line Graphs
Journal: Graphs and Combinatorics Year: 2023 Vol: 39 (5)
JOURNAL ARTICLE
Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph
Journal: Contributions to Discrete Mathematics Year: 2024 Vol: 19 (2)Pages: 23-35
JOURNAL ARTICLE
Two completely independent spanning trees of split graphs
Xiao Dong ChenQinghai LiuXiwu Yang
Journal: Discrete Applied Mathematics Year: 2023 Vol: 340 Pages: 76-78
JOURNAL ARTICLE
Completely independent spanning trees in some regular graphs
Benoît DartiesNicolas GastineauOlivier Togni
Journal: Discrete Applied Mathematics Year: 2016 Vol: 217 Pages: 163-174
JOURNAL ARTICLE
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
Journal: Lecture notes in computer science Year: 2000 Vol: 84 (5)Pages: 290-301