Squared Chromatic Number Without Claws or Large Cliques

DOI10.4153/CMB-2018-024-5zbMath1409.05082arXiv1609.08646MaRDI QIDQ3121310

Ross J. Kang, Wouter Cames van Batenburg

Publication date: 15 March 2019

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

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

zbMATH Keywords

claw-free graphgraph colouringErdő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 (5)

Minimum maximal matchings in cubic graphs ⋮ Maximizing Line Subgraphs of Diameter at Most t ⋮ Strong chromatic index and Hadwiger number ⋮ Colouring Squares of Claw-free Graphs ⋮ Recent progress on strong edge-coloring of graphs

Cites Work

• Claw-free graphs. VI: Colouring
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Colouring squares of claw-free graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Induced matchings in cubic graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Squared Chromatic Number Without Claws or Large Cliques