Two trees in maximal planar bipartite graphs

DOI10.1002/JGT.3190170610MaRDI QIDQ4285595zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

maximal planar bipartite graphtrees

Mathematics Subject Classification ID

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

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

Cited in

(12)

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