On the number of maximal bipartite subgraphs of a graph

DOI10.1002/jgt.20041zbMath1059.05045OpenAlexW4244894548MaRDI QIDQ4667793

Bolette Ammitzbøll Madsen, Jesper Makholm Byskov, Bjarke Skjernaa

Publication date: 21 April 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20041

zbMATH Keywords

coloringcoloring algorithmsmaximal bipartite subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On the number of connected sets in bounded degree graphs ⋮ Feedback Vertex Sets in Tournaments ⋮ Branch and recharge: exact algorithms for generalized domination ⋮ On the minimum feedback vertex set problem: Exact and enumeration algorithms

Cites Work

• Small Maximal Independent Sets and Faster Exact Graph Coloring
• Unnamed Item

This page was built for publication: On the number of maximal bipartite subgraphs of a graph