Maximumk-colorable subgraphs

DOI10.1002/jgt.3190060206zbMath0475.05034OpenAlexW1538767552MaRDI QIDQ3931416

Stephen C. Locke

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.3190060206

zbMATH Keywords

vertex colourings3-regular graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (17)

Problems and results on judicious partitions ⋮ On parsimonious edge-colouring of graphs with maximum degree three ⋮ Bounds on the bisection width for random \(d\)-regular graphs ⋮ Parsimonious edge coloring ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Bisections of graphs ⋮ 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 ⋮ 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 ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Bipartite density of triangle-free subcubic graphs ⋮ Judicious partitions of bounded‐degree graphs ⋮ Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality

Cites Work

• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Some Extremal Properties of Bipartite Subgraphs
• Unnamed Item

This page was built for publication: Maximumk-colorable subgraphs