Colouring Squares of Claw-free Graphs

DOI10.4153/CJM-2017-029-9zbMath1405.05064MaRDI QIDQ4625179

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

Publication date: 21 February 2019

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Polynomial removal lemmas for ordered graphs ⋮ Maximizing Line Subgraphs of Diameter at Most t ⋮ Strong chromatic index and Hadwiger number

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
• Squared Chromatic Number Without Claws or Large Cliques
• 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