Two trees in maximal planar bipartite graphs

DOI10.1002/JGT.3190170610zbMATH Open0791.05082OpenAlexW2109294423MaRDI QIDQ4285595FDOQ4285595

Authors: Gerhard Ringel 

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

Recommendations

• scientific article; zbMATH DE number 1507297
• Two-graphs and trees
• Maximum plane trees in multipartite geometric graphs
• Maximum plane trees in multipartite geometric graphs
• Bipartite embeddings of trees in the plane
• Two-tree graphs with maximum general sum-connectivity index
• Maximal trees with bounded maximum degree in a graph
• Bipartite graphs with even spanning trees
• Maximum order of trees and bipartite graphs with a given rank
• Induced forests in bipartite planar graphs

zbMATH Keywords

treesmaximal planar bipartite graph

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (12)

• A note on the tree decompositions of graphs
• The degree/diameter problem in maximal planar bipartite graphs
• The degree/diameter problem in maximal planar bipartite graphs
• Hamiltonicity and generalised total colourings of planar graphs
• 4-labelings and grid embeddings of plane quadrangulations
• Minimum degree and minimum number of edge-disjoint trees
• A left-first search algorithm for planar graphs
• Tree decomposition
• On the tree number of regular graphs
• Applications of matroid partition to tree decomposition
• Tree-decompositions of graphs. I
• Tree decompositions for a class of graphs

This page was built for publication: Two trees in maximal planar bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285595)