On the partition of 3-colorable graphs

DOI10.1007/978-3-642-22616-8_34zbMATH Open1342.05118OpenAlexW175284823MaRDI QIDQ5199169FDOQ5199169

Authors: Yang Liu, Qing Wang 

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

Recommendations

• Exact algorithms for counting 3-colorings of graphs
• Dominating set based exact algorithms for \(3\)-coloring
• Improved Exact Algorithms for Counting 3- and 4-Colorings
• Improved edge-coloring with three colors
• Improved Edge-Coloring with Three Colors

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (7)

• Mixing 3-Colourings in Bipartite Graphs
• Title not available (Why is that?)
• Balanced partitions of 3-colored geometric sets in the plane
• Tiling tripartite graphs with 3-colorable graphs
• On 3-colorings of bipartitep-threshold graphs
• Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
• Title not available (Why is that?)

This page was built for publication: On the partition of 3-colorable graphs

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