Three edge-coloring conjectures

DOI10.7151/DMGT.1166MaRDI QIDQ4786796zbMATH OpenOpenAlexWikidataFDO

Authors R. H. Schelp

Publication date 6 May 2003

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1166

zbMATH Keywords

edge-coloringstrong chromatic indexRamsey numberlocal coloringvertex-distinguishing edge-coloringbalanced edge-coloringmean coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• A note on local coloring of graphs
• Ramsey numbers for local colorings
• Local edge colorings that are global
• Local k-colorings of graphs and hypergraphs
• Local and meank-Ramsey numbers for complete graphs

Cited in

(4)

• 3-consecutive edge coloring of a graph
• The Erdős-Hajnal conjecture for three colors and triangles
• Three measures of edge-uncolorability
• Bordeaux 3-color conjecture and 3-choosability

This page was built for publication: Three edge-coloring conjectures

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