Bipartite subgraphs of graphs with maximum degree three

DOI10.1007/s003730050047zbMath0931.05040OpenAlexW2014378349MaRDI QIDQ1299990

Stanisław Bylka, Jan Komar, Adam Idzik

Publication date: 22 November 1999

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050047

zbMATH Keywords

extremal graphsconnected graphmaximum degreebipartite subgraphbicolouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

New formulae for the bipartite vertex frustration and decycling number of graphs ⋮ Nordhaus-Gaddum and other bounds for the chromatic edge-stability number ⋮ Consensus algorithms for the generation of all maximal bicliques

This page was built for publication: Bipartite subgraphs of graphs with maximum degree three