Between 2- and 3-colorability
From MaRDI portal
Publication:5902303
DOI10.1016/j.ipl.2005.01.008zbMath1182.68149OpenAlexW1970704996MaRDI QIDQ5902303
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.01.008
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ Stable-\(\Pi\) partitions of graphs ⋮ Recognizing Graphs Close to Bipartite Graphs
Cites Work
- Unnamed Item
- Some simplified NP-complete graph problems
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- On the size of hereditary classes of graphs
- The speed of hereditary properties of graphs
- Bisplit graphs
- Node-Deletion Problems on Bipartite Graphs
- On the computational complexity of (O,P)-partition problems
- Difference graphs
This page was built for publication: Between 2- and 3-colorability