Maximizing Line Subgraphs of Diameter at Most t

DOI10.1137/21M1437354zbMath1486.05154arXiv2103.11898OpenAlexW4223516954MaRDI QIDQ5071098

Stijn Cambie, Wouter Cames van Batenburg, Ross J. Kang, Rémi de Joannis de Verclos

Publication date: 20 April 2022

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

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

zbMATH Keywords

degree-diameter problemstrong cliquesdistance edge-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance edge-colourings and matchings
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Problems and results in combinatorial analysis and graph theory
• Strong cliques and forbidden cycles
• Asymptotically large (\(\Delta,D\))-graphs
• Squared Chromatic Number Without Claws or Large Cliques
• Colouring Squares of Claw-free Graphs
• Distance Colouring Without One Cycle Length
• $t$-Strong Cliques and the Degree-Diameter Problem
• 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
• On Minimal graphs of maximum even girth

This page was built for publication: Maximizing Line Subgraphs of Diameter at Most t