scientific article; zbMATH DE number 1501098

zbMATH Open0951.05029MaRDI QIDQ4499992FDOQ4499992

Authors: Yan Chen 

Publication date: 9 November 2000

Title of this publication is not available (Why is that?)

Recommendations

• On spanning trees without vertices of degree 2 in plane triangulations
• Upper bounds on minimum balanced bipartitions of plane graphs
• Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
• Plane bichromatic trees of low degree
• Minimum balanced bipartitions of planar triangulations

zbMATH Keywords

graphtriangulationchromatic numbermaximum degreebipartite spanning subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (3)

• The degree/diameter problem in maximal planar bipartite graphs
• The degree/diameter problem in maximal planar bipartite graphs
• Maximum bipartite subgraphs of cubic triangle-free planar graphs

This page was built for publication:

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