Clique number of the square of a line graph

DOI10.1016/j.disc.2016.01.003zbMath1333.05260arXiv1504.06585OpenAlexW1681279317MaRDI QIDQ271628

Małgorzata Śleszyńska-Nowak

Publication date: 7 April 2016

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

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

zbMATH Keywords

clique number of the square of a line graphfractional strong chromatic indexstrong chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Strong edge coloring of circle graphs, The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs, The strong clique index of a graph with forbidden cycles, A Stronger Bound for the Strong Chromatic Index, Fractional strong chromatic index of bipartite graphs, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong chromatic index of sparse graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Induced matchings in bipartite graphs
• Incidence and strong edge colorings of graphs
• A bound on the strong chromatic index of a graph
• Graph colouring and the probabilistic method