Extremal bipartite subgraphs of cubic triangle-free graphs
From MaRDI portal
Publication:3946190
DOI10.1002/jgt.3190060205zbMath0486.05036OpenAlexW2053877774MaRDI QIDQ3946190
No author found.
Publication date: 1982
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190060205
Related Items
Problems and results on judicious partitions, Parsimonious edge coloring, The bipartite edge frustration of composite graphs, Maximum directed cuts in graphs with degree constraints, Lower Bounds for Maximum Weighted Cut, On a bipartition problem of Bollobás and Scott, 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, The ubiquitous Petersen graph, Max-cut in circulant graphs, Triangle-free subcubic graphs with minimum bipartite density, New formulae for the bipartite vertex frustration and decycling number of graphs, Some remarks on Hajós' conjecture, The bipartite edge frustration of extension of splice and link graphs, Bipartite subgraphs of triangle-free subcubic graphs, Maximum bipartite subgraphs of cubic triangle-free planar graphs, High-girth cubic graphs are homomorphic to the Clebsch graph, Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3, Approximability Distance in the Space of H-Colourability Problems, Bipartite density of triangle-free subcubic graphs, Judicious partitions of bounded‐degree graphs
