Strong cliques in claw-free graphs

DOI10.1007/s00373-021-02379-6zbMath1479.05258OpenAlexW3184540068MaRDI QIDQ2053719

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

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02379-6

zbMATH Keywords

strong cliquestrong chromatic indexstrong edge coloring

Mathematics Subject Classification ID

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

Related Items (1)

The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique number of the square of a line graph
• The strong chromatic index of sparse graphs
• Strong chromatic index of subcubic planar multigraphs
• Strong chromatic index of \(K_{1, t}\)-free graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• 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 edge-coloring of graphs with maximum degree 4 using 22 colors
• The strong chromatic index ofC4-free graphs
• A Stronger Bound for the Strong Chromatic Index
• Strong chromatic index of unit distance graphs
• Induced matchings in cubic graphs
• Strong Chromatic Index of 2-Degenerate Graphs
• On the clique number of the square of a line graph and its relation to maximum degree of the line graph
• The Strong Chromatic Index of Random Graphs
• Strong edge-coloring of planar graphs

This page was built for publication: Strong cliques in claw-free graphs