3-consecutive edge coloring of a graph

DOI10.1016/j.disc.2011.04.006zbMath1232.05075OpenAlexW1981633020WikidataQ59072553 ScholiaQ59072553MaRDI QIDQ658096

Zsolt Tuza, E. Sampathkumar, Csilla Bujtás, L. Pushpa Latha, Charles Dominic

Publication date: 11 January 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.006

zbMATH Keywords

vertex cutconsecutive edge coloring numbermaximum number of colors

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Vertex neighborhood restricted edge achromatic sums of graphs ⋮ Unnamed Item ⋮ Maximum number of colors: C-coloring and related problems ⋮ 3-consecutive edge coloring of a graph ⋮ \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ 3-Sequent achromatic sum of graphs ⋮ Injective edge coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Improper C-colorings of graphs
• 3-consecutive edge coloring of a graph
• On stable cutsets in claw-free graphs and planar graphs
• Matching cutsets in graphs of diameter 2
• Parallel concepts in graph theory
• On stable cutsets in line graphs
• On stable cutsets in graphs
• A note on fragile graphs
• 3-consecutive C-colorings of graphs
• Matching cutsets in graphs

This page was built for publication: 3-consecutive edge coloring of a graph