Strong cliques and forbidden cycles

DOI10.1016/j.indag.2019.09.003zbMath1431.05063arXiv1903.06087OpenAlexW2981084315WikidataQ127093757 ScholiaQ127093757MaRDI QIDQ2288223

Ross J. Kang, François Pirot, Wouter Cames van Batenburg

Publication date: 17 January 2020

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

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

zbMATH Keywords

strong chromatic indexforbidden cyclesstrong clique number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (4)

Strong edge coloring of circle graphs ⋮ Maximizing Line Subgraphs of Diameter at Most t ⋮ The strong clique index of a graph with forbidden cycles ⋮ $t$-Strong Cliques and the Degree-Diameter Problem

Cites Work

• Unnamed Item
• Clique number of the square of a line graph
• Induced matchings in bipartite graphs
• Problems and results in combinatorial analysis and graph theory
• A bound on the strong chromatic index of a graph
• On maximal paths and circuits of graphs
• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
• The strong chromatic index ofC4-free graphs
• A Stronger Bound for the Strong Chromatic Index
• Distance Colouring Without One Cycle Length
• On the clique number of the square of a line graph and its relation to maximum degree of the line graph

This page was built for publication: Strong cliques and forbidden cycles