Maximum bipartite subgraphs of cubic triangle-free planar graphs

DOI10.1016/j.disc.2007.12.001zbMath1167.05038OpenAlexW1972250365MaRDI QIDQ1011782

Qing Cui, Ji'an Wang

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.001

zbMATH Keywords

triangle-freebipartite subgraphcubic planar graphTutte subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

The bipartite edge frustration of composite graphs, Study of the Bipartite Edge Frustration of Graphs, The bipartite edge frustration of graphs under subdivided edges and their related sums, On the anti-Kekulé number and odd cycle transversal of regular graphs, Extremal properties of the bipartite vertex frustration of graphs, Packing and covering odd cycles in cubic plane graphs with small faces, Packing and covering odd cycles in cubic plane graphs with small faces

Cites Work

• Unnamed Item
• Unnamed Item
• 4-connected projective planar graphs are Hamiltonian
• Decomposing a planar graph into degenerate graphs
• On some extremal problems in graph theory
• Graphs with forbidden subgraphs
• Disjoint paths, planarizing cycles, and spanning walks
• A Theorem on Planar Graphs
• On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Maximumk-colorable subgraphs
• Extremal bipartite subgraphs of cubic triangle-free graphs
• Some Extremal Properties of Bipartite Subgraphs
• A theorem on paths in planar graphs