Improved Exact Algorithms for Counting 3- and 4-Colorings
From MaRDI portal
Publication:3608832
DOI10.1007/978-3-540-73545-8_9zbMath1206.05041OpenAlexW1598159863WikidataQ56269090 ScholiaQ56269090MaRDI QIDQ3608832
Serge Gaspers, Saket Saurabh, Fedor V. Fomin
Publication date: 6 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_9
Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Colorings with few colors: counting, enumeration and combinatorial bounds ⋮ Enumeration of minimal tropical connected sets ⋮ Enumerating the edge-colourings and total colourings of a regular graph ⋮ Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds ⋮ Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 ⋮ Exact algorithms for counting 3-colorings of graphs ⋮ Exponential-time quantum algorithms for graph coloring problems
This page was built for publication: Improved Exact Algorithms for Counting 3- and 4-Colorings
