3-consecutive edge coloring of a graph

DOI10.1016/J.DISC.2011.04.006zbMATH Open1232.05075OpenAlexW1981633020WikidataQ59072553 ScholiaQ59072553MaRDI QIDQ658096FDOQ658096

Authors: Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha 

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

Recommendations

• 3-consecutive vertex coloring of a graph
• 3-consecutive C-colorings of graphs
• Three edge-coloring conjectures
• Conjectures on uniquely 3-edge-colorable graphs
• Edge-coloring of 3-uniform hypergraphs
• Consecutive colorings of the edges of general graphs
• scientific article; zbMATH DE number 3878955
• Publication:4351080
• On 3-hued coloring of graphs
• On colorful edge triples in edge-colored complete graphs

zbMATH Keywords

vertex cutconsecutive edge coloring numbermaximum number of colors

Mathematics Subject Classification ID

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

Cites Work

• Parallel concepts in graph theory
• 3-consecutive C-colorings of graphs
• On stable cutsets in graphs
• Title not available (Why is that?)
• Matching cutsets in graphs
• On stable cutsets in line graphs
• 3-consecutive vertex coloring of a graph
• Improper C-colorings of graphs
• 3-consecutive edge coloring of a graph
• Matching cutsets in graphs of diameter 2
• A note on fragile graphs
• On stable cutsets in claw-free graphs and planar graphs

Cited In (15)

• Complexity of Computing the Anti-Ramsey Numbers for Paths.
• Consecutive edge-colorings of generalized \(\theta \)-graphs
• Injective edge coloring of graphs
• Title not available (Why is that?)
• 3-consecutive edge coloring of a graph
• Consecutive colorings of the edges of general graphs
• 3-consecutive vertex coloring of a graph
• Maximum number of colors: C-coloring and related problems
• Vertex neighborhood restricted edge achromatic sums of graphs
• Consecutive edge-coloring of the generalized \(\theta \)-graph
• When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence.
• Consecutive colorings of graphs
• 3-sequent achromatic sum of graphs
• 3-consecutive C-colorings of graphs
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum

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

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