Semistrong edge coloring of graphs

DOI10.1002/JGT.20061MaRDI QIDQ4680403zbMATH OpenOpenAlexFDO

Authors András Gyárfás, Alice Hubenko

Publication date 1 June 2005

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

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

zbMATH Keywords

cubesKneser graphsinduced matchingssubset graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Large rainbow matchings in semi-strong edge-colorings of graphs
• scientific article; zbMATH DE number 3851125
• Strong edge-colouring and induced matchings
• Strong chromatic index of subset graphs
• The strong edge-coloring for graphs with small edge weight

Cited in

(9)

• Total dominating sequences in graphs
• \((1, 0)\)-relaxed strong edge list coloring of planar graphs with girth \(6\)
• Grundy domination and zero forcing in Kneser graphs
• Large rainbow matchings in semi-strong edge-colorings of graphs
• Total dominating sequences in trees, split graphs, and under modular decomposition
• Revisiting semistrong edge‐coloring of graphs
• A note on semi-coloring of graphs
• Semi-strong chromatic number of a graph
• On \((s,t)\)-relaxed strong edge-coloring of graphs

This page was built for publication: Semistrong edge coloring of graphs

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