共 50 条
- [2] Completely independent spanning trees in maximal planar graphs [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2002, 2573 : 235 - 245
- [5] A linear-time algorithm to find independent spanning trees in maximal planar graphs [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (05): : 1102 - 1109
- [7] Decomposition of some planar graphs into trees [J]. DISCRETE MATHEMATICS, 1996, 150 (1-3) : 449 - 451
- [8] Uniform Spanning Trees of Planar Graphs [J]. PLANAR MAPS, RANDOM WALKS AND CIRCLE PACKING: ECOLE D'ETE DE PROBABILITES DE SAINT-FLOUR XLVIII - 2018, 2020, 2243 : 89 - 103
- [9] Independent spanning trees of product graphs [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 338 - 351
- [10] Independent trees and branchings in planar multigraphs [J]. GRAPHS AND COMBINATORICS, 1999, 15 (02) : 211 - 220