English

Classifying k-Edge Colouring for H-free Graphs

Data Structures and Algorithms 2018-10-11 v1 Computational Complexity Discrete Mathematics Combinatorics
Authors: Esther Galby , Paloma T. Lima , Daniel Paulusma , Bernard Ries
View on arXiv ↗ PDF ↗

Abstract

A graph is HH-free if it does not contain an induced subgraph isomorphic to HH. For every integer kk and every graph HH, we determine the computational complexity of kk-Edge Colouring for HH-free graphs.

Keywords

graph homomorphism graph coloring graph theory

Cite

@article{arxiv.1810.04379,
  title  = {Classifying k-Edge Colouring for H-free Graphs},
  author = {Esther Galby and Paloma T. Lima and Daniel Paulusma and Bernard Ries},
  journal= {arXiv preprint arXiv:1810.04379},
  year   = {2018}
}

Related papers

View all related →
Combinatorics · Mathematics
Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin +1
2026-02-23
Combinatorics · Mathematics
Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter
Barnaby Martin, Daniel Paulusma, Siani Smith
2021-11-24
Combinatorics · Mathematics
Edge Contraction and Forbidden Induced Graphs
Hany Ibrahim, Peter Tittmann
2022-12-20
Combinatorics · Mathematics
Obstructions for three-coloring and list three-coloring $H$-free graphs
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2018-02-08
Combinatorics · Mathematics
Edge Contraction and Line Graphs
Hany Ibrahim, Peter Tittmann
2023-03-07
Computational Complexity · Computer Science
On Colouring $(2P_2,H)$-Free and $(P_5,H)$-Free Graphs
Konrad Dabrowski, Daniel Paulusma
2017-12-08
Combinatorics · Mathematics
Some Results on Critical ($P_5,H$)-free Graphs
Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2024-03-12
Combinatorics · Mathematics
Extremal results on $G$-free colorings of graphs
Yaser Rowshan
2022-01-21
Combinatorics · Mathematics
Making an $H$-Free Graph $k$-Colorable
Jacob Fox, Zoe Himwich, Nitya Mani
2021-03-23
Data Structures and Algorithms · Computer Science
Colouring $(P_r+P_s)$-Free Graphs
Tereza Klimošová, Josef Malík, Tomáš Masařík, Jana Novotná +2
2026-02-19
Discrete Mathematics · Computer Science
Colouring Diamond-free Graphs
Konrad K. Dabrowski, François Dross, Daniël Paulusma
2016-09-06
Computational Complexity · Computer Science
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs
Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2016-02-16
Combinatorics · Mathematics
$k$-Critical Graphs in $P_5$-Free Graphs
Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi
2020-05-08
Combinatorics · Mathematics
Distinguishing infinite star-free graphs
Marcin Stawiski
2021-05-25
Combinatorics · Mathematics
Injective edge-coloring of claw-free graphs with maximum degree 4
Danjun Huang, Yuqian Guo
2025-09-12
Computational Complexity · Computer Science
Improved Complexity Results on $k$-Coloring $P_t$-Free Graphs
Shenwei Huang
2013-10-07
Data Structures and Algorithms · Computer Science
Complexity of $C_k$-coloring in hereditary classes of graphs
Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski, Sophie Spirkl +1
2023-03-06
Data Structures and Algorithms · Computer Science
Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2017-06-08
Combinatorics · Mathematics
$H$-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
Noga Alon, Clara Shikhelman
2017-06-20
Discrete Mathematics · Computer Science
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs
Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2014-02-11
Computational Complexity · Computer Science
Narrowing the Complexity Gap for Colouring ($C_s$,$P_t$)-Free Graphs
Shenwei Huang, Matthew Johnson, Daniël Paulusma
2014-07-08
Combinatorics · Mathematics
List-$k$-Coloring $H$-free graphs for all $k>4$
Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl
2025-04-08
Combinatorics · Mathematics
Certifying coloring algorithms for graphs without long induced paths
Marcin Kamiński, Anna Pstrucha
2017-03-08
Combinatorics · Mathematics
Some Results on $k$-Critical $P_5$-Free Graphs
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
2021-08-21
Combinatorics · Mathematics
Induced subgraphs and tree-decompositions VII. Basic obstructions in $H$-free graphs
Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi +1
2023-11-08
R2 v1 2026-06-23T04:34:27.245Z