On the Partition of 3-Colorable Graphs
From MaRDI portal
Publication:5199169
DOI10.1007/978-3-642-22616-8_34zbMath1342.05118OpenAlexW175284823MaRDI QIDQ5199169
Publication date: 12 August 2011
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_34
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: On the Partition of 3-Colorable Graphs
