Colouring squares of claw-free graphs

DOI10.1016/j.endm.2017.07.021zbMath1379.05044arXiv1609.08645OpenAlexW2963029441MaRDI QIDQ1689990

Lucas Pastor, Rémi de Joannis de Verclos, Ross J. Kang

Publication date: 18 January 2018

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

zbMATH Keywords

graph colouringclaw-free graphsErdős-Nešetřil conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Tree-like distance colouring for planar graphs of sufficient girth ⋮ Recent progress on strong edge-coloring of graphs ⋮ Squared Chromatic Number Without Claws or Large Cliques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stronger bound for the strong chromatic index (extended abstract)
• Claw-free graphs. VI: Colouring
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• The stable set polytope of quasi-line graphs
• Problems and results in combinatorial analysis and graph theory
• Applications of edge coloring of multigraphs to vertex coloring of graphs
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• A note on Ramsey numbers
• A bound on the strong chromatic index of a graph
• Claw-free graphs. VII. Quasi-line graphs
• Coloring quasi-line graphs
• Asymptotics of the chromatic number for quasi-line graphs
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ
• Paths, Trees, and Flowers
• Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

This page was built for publication: Colouring squares of claw-free graphs