Bipartite subgraphs of graphs with maximum degree three

DOI10.1007/S003730050047MaRDI QIDQ1299990zbMATH OpenOpenAlexFDO

Authors Stanisław Bylka, Adam Idzik, Jan Komar

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

connected graphextremal graphsmaximum degreebipartite subgraphbicolouring

Mathematics Subject Classification ID

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

Recommendations

• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Bipartite subgraphs of triangle-free subcubic graphs
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• scientific article; zbMATH DE number 4008428
• Bipartite subgraphs

Cited in

(9)

• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Extremal connectivity for topological cliques in bipartite graphs
• New formulae for the bipartite vertex frustration and decycling number of graphs
• Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
• scientific article; zbMATH DE number 5545497 (Why is no real title available?)
• Consensus algorithms for the generation of all maximal bicliques
• Concatenating bipartite graphs
• scientific article; zbMATH DE number 4008428 (Why is no real title available?)
• scientific article; zbMATH DE number 841651 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1299990)