3-consecutive vertex coloring of a graph

MaRDI QIDQ3012400zbMATH OpenFDO

Authors E. Sampathkumar, M. S. Subramanya, Charles Dominic

Publication date 6 July 2011

zbMATH Keywords

3-consecutive coloring3-consecutive coloring number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• 3-consecutive edge coloring of a graph
• 3-consecutive C-colorings of graphs
• When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence.
• 3-sequent achromatic sum of graphs
• Consecutive colorings of the edges of general graphs

Cited in

(12)

• Method of 3-colouring of graphs
• When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence.
• 3-consecutive C-colorings of graphs
• Maximum number of colors: C-coloring and related problems
• Vertex coloring without large polychromatic stars
• 3-sequent achromatic sum of graphs
• scientific article; zbMATH DE number 7589550 (Why is no real title available?)
• Vertex neighborhood restricted edge achromatic sums of graphs
• Improper C-colorings of graphs
• 3-consecutive edge coloring of a graph
• Edge incident 2-edge coloring of graphs
• Satisfactory graph partition, variants, and generalizations

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

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