Two trees in maximal planar bipartite graphs
From MaRDI portal
Publication:4285595
DOI10.1002/jgt.3190170610zbMath0791.05082OpenAlexW2109294423MaRDI QIDQ4285595
No author found.
Publication date: 24 March 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170610
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (12)
Hamiltonicity and generalised total colourings of planar graphs ⋮ A left-first search algorithm for planar graphs ⋮ On the tree number of regular graphs ⋮ Tree-decompositions of graphs. I ⋮ A note on the tree decompositions of graphs ⋮ 4-labelings and grid embeddings of plane quadrangulations ⋮ Minimum degree and minimum number of edge-disjoint trees ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Tree decomposition ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Applications of matroid partition to tree decomposition ⋮ Tree decompositions for a class of graphs
This page was built for publication: Two trees in maximal planar bipartite graphs
