Graph coloring below guarantees via co-triangle packing
From MaRDI portal
Cites work
- A (2 + ) k-vertex kernel for the dual coloring problem
- Complexity of coloring graphs without forbidden induced subgraphs
- Division-free algorithms for the determinant and the Pfaffian: Algebraic and combinatorial approaches
- 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
- 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 819814 (Why is no real title available?)
- Induced matching below guarantees: average paves the way for fixed-parameter tractability
- Kernelization. Theory of parameterized preprocessing
- Linear kernels in linear time, or how to save \(k\) colors in \(O(n^{2})\) steps
- 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)