$t$-Strong Cliques and the Degree-Diameter Problem

DOI10.1137/21M1406970zbMath1480.05040MaRDI QIDQ5020846

Michał Dębski, Małgorzata Śleszyńska-Nowak

Publication date: 7 January 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

strong chromatic indexdegree/diameter problemstrong edge coloring\(t\)-strong cliquesdistance-\(t\) chromatic indexstrong cliques

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) Distance in graphs (05C12)

Related Items (1)

Maximizing Line Subgraphs of Diameter at Most t

Cites Work

• Unnamed Item
• Clique number of the square of a line graph
• A stronger bound for the strong chromatic index (extended abstract)
• Distance edge-colourings and matchings
• Induced matchings in bipartite graphs
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Strong chromatic index of graphs with maximum degree four
• Strong cliques and forbidden cycles
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Asymptotically large (\(\Delta,D\))-graphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• Coloring Powers and Girth
• The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs
• 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
• The Distance-t Chromatic Index of Graphs
• Graph colouring and the probabilistic method
• The strong clique index of a graph with forbidden cycles

This page was built for publication: $t$-Strong Cliques and the Degree-Diameter Problem