Graph coloring below guarantees via co-triangle packing

DOI10.4230/LIPICS.ISAAC.2025.5MaRDI QIDQ7364339zbMATH OpenFDO

Authors Shyan S. Akmal, Tomohiro Koana

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.5

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A (2 + ) k-vertex kernel for the dual coloring problem
• Every planar map is four colorable. I: Discharging
• Faster edge coloring by partition sieving
• Finding large set covers faster via the representation method
• Fourier meets M\"{o}bius: fast subset convolution
• Graph-Theoretic Concepts in Computer Science
• Hadwiger's conjecture is true for almost every graph
• scientific article; zbMATH DE number 3503283 (Why is no real title available?)
• scientific article; zbMATH DE number 2044943 (Why is no real title available?)
• scientific article; zbMATH DE number 1775055 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Induced matching below guarantees: average paves the way for fixed-parameter tractability
• Kernelization. Theory of parameterized preprocessing
• Parameterized algorithms
• Parameterized pre-coloring extension and list coloring problems
• Set partitioning via inclusion-exclusion
• Some simplified NP-complete graph problems
• The strong perfect graph theorem

This page was built for publication: Graph coloring below guarantees via co-triangle packing

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