Strong cliques in claw-free graphs

DOI10.1007/S00373-021-02379-6MaRDI QIDQ2053719zbMATH OpenOpenAlexFDO

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

Publication date 30 November 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

strong chromatic indexstrong cliquestrong edge coloring

Mathematics Subject Classification ID

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

Recommendations

• Clique number of the square of a line graph
• The strong clique index of a graph with forbidden cycles
• Squared chromatic number without claws or large cliques
• Strong cliques and forbidden cycles
• Strong edge coloring of circle graphs

Cites work

• A bound on the strong chromatic index of a graph
• A stronger bound for the strong chromatic index
• Clique number of the square of a line graph
• scientific article; zbMATH DE number 4177085 (Why is no real title available?)
• scientific article; zbMATH DE number 3851125 (Why is no real title available?)
• scientific article; zbMATH DE number 1286500 (Why is no real title available?)
• scientific article; zbMATH DE number 4187830 (Why is no real title available?)
• Induced matchings in bipartite graphs
• Induced matchings in cubic graphs
• On the clique number of the square of a line graph and its relation to maximum degree of the line graph
• Strong chromatic index of 2-degenerate graphs
• Strong chromatic index of \(K_{1, t}\)-free graphs
• Strong chromatic index of graphs with maximum degree four
• Strong chromatic index of subcubic planar multigraphs
• Strong chromatic index of unit distance graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong edge-coloring of planar graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• The strong chromatic index of a cubic graph is at most 10
• The Strong Chromatic Index of Random Graphs
• The strong chromatic index of sparse graphs
• The strong chromatic index ofC4-free graphs

Cited in

(13)

• Colouring squares of claw-free graphs
• Strong edge coloring of circle graphs
• The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs
• Strong cliques and forbidden cycles
• Strong cliques and equistability of EPT graphs
• Clique number of the square of a line graph
• Squared chromatic number without claws or large cliques
• Colouring squares of claw-free graphs
• t-strong cliques and the degree-diameter problem
• The strong clique index of a graph with forbidden cycles
• Strongly perfect claw‐free graphs—A short proof
• Strong cliques in vertex‐transitive graphs
• \(t\)-strong cliques and the degree-diameter problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053719)