On the clique number of the square of a line graph and its relation to maximum degree of the line graph

DOI10.1002/jgt.22452zbMath1429.05179OpenAlexW2913253550WikidataQ128464897 ScholiaQ128464897MaRDI QIDQ5207468

Maxime Faron, Luke Postle

Publication date: 30 December 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22452

zbMATH Keywords

clique numbersquare of a line graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

Related Items

The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs ⋮ Maximizing Line Subgraphs of Diameter at Most t ⋮ The strong clique index of a graph with forbidden cycles ⋮ Strong cliques and forbidden cycles ⋮ Strong cliques in claw-free graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ $t$-Strong Cliques and the Degree-Diameter Problem