A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)

DOI10.1007/s00373-022-02553-4zbMath1497.05090arXiv2110.08004OpenAlexW3207744794MaRDI QIDQ2674382

Martin Koutecký

Publication date: 12 September 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.08004

zbMATH Keywords

integer programminggraph coloringneighborhood diversity

Mathematics Subject Classification ID

Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Coloring \((4K_1,C_4,C_6)\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmic meta-theorems for restrictions of treewidth
• Decomposition of even-hole-free graphs with star cutsets and 2-joins
• The intersection of two vertex coloring problems
• A faster algorithm to recognize even-hole-free graphs
• Even-hole-free graphs part I: Decomposition theorem
• Parameterized Algorithms for Modular-Width
• Integer Programming with a Fixed Number of Variables
• Even-hole-free graphs part II: Recognition algorithm
• Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
• On Integer Programming and Convolution.

This page was built for publication: A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)