Pages that link to "Item:Q1011782"
From MaRDI portal
The following pages link to Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782):
Displaying 15 items.
- The bipartite edge frustration of composite graphs (Q608263) (← links)
- The bipartite edge frustration of graphs under subdivided edges and their related sums (Q651481) (← links)
- Extremal properties of the bipartite vertex frustration of graphs (Q654182) (← links)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- Bipartite subgraphs of graphs with maximum degree three (Q1299990) (← links)
- A planarity criterion for cubic bipartite graphs (Q1584420) (← links)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. (Q1853125) (← links)
- Bipartite density of cubic graphs (Q1861239) (← links)
- On the anti-Kekulé number and odd cycle transversal of regular graphs (Q2446864) (← links)
- Triangle-free subcubic graphs with minimum bipartite density (Q2483477) (← links)
- Bipartite subgraphs of triangle-free subcubic graphs (Q2519015) (← links)
- Study of the Bipartite Edge Frustration of Graphs (Q2980024) (← links)
- On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation (Q3418193) (← links)
- Packing and covering odd cycles in cubic plane graphs with small faces (Q5915831) (← links)
- Packing and covering odd cycles in cubic plane graphs with small faces (Q5920132) (← links)
