scientific article; zbMATH DE number 1501098

MaRDI QIDQ4499992zbMATHFDO

Authors Yan Chen

Publication date 9 November 2000

zbMATH Keywords

graphtriangulationchromatic numbermaximum degreebipartite spanning subgraph

Mathematics Subject Classification ID

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

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
• Minimum balanced bipartitions of planar triangulations

Cited in

(4)

• 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
• The spanning maximal planar subgraph problem for some classes of complete 4-partite 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)