Pages that link to "Item:Q3946190"
From MaRDI portal
The following pages link to Extremal bipartite subgraphs of cubic triangle-free graphs (Q3946190):
Displaying 23 items.
- The bipartite edge frustration of composite graphs (Q608263) (← links)
- On a bipartition problem of Bollobás and Scott (Q624186) (← 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)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- The bipartite edge frustration of extension of splice and link graphs (Q988725) (← links)
- Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- The ubiquitous Petersen graph (Q1198655) (← links)
- Max-cut in circulant graphs (Q1201272) (← links)
- Parsimonious edge coloring (Q1910535) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← 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)
- High-girth cubic graphs are homomorphic to the Clebsch graph (Q3083411) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
