Pages that link to "Item:Q3749084"
From MaRDI portal
The following pages link to Largest bipartite subgraphs in triangle-free graphs with maximum degree three (Q3749084):
Displaying 33 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)
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422) (← links)
- Finding bipartite subgraphs efficiently (Q991744) (← 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)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Bipartite subgraphs of graphs with maximum degree three (Q1299990) (← links)
- The size of the largest bipartite subgraphs (Q1377883) (← 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)
- Parsimonious edge coloring (Q1910535) (← links)
- Edge density and independence ratio in triangle-free graphs with maximum degree three (Q1917491) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- On large bipartite graphs of diameter 3 (Q1937548) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- On parsimonious edge-colouring of graphs with maximum degree three (Q2376086) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← 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)
- Maximum directed cuts in digraphs with degree restriction (Q3633002) (← links)
- Maximumk-colorable subgraphs (Q3931416) (← links)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- On Maximum Edge Cuts of Connected Digraphs (Q5418765) (← links)
- Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
