Balanced edge colorings.

DOI10.1016/S0095-8956(03)00073-XzbMath1033.05036OpenAlexW1974249009MaRDI QIDQ1425105

Hao Li, Alexandr V. Kostochka, Richard H. Schelp, Paul N. Balister

Publication date: 15 March 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00073-x

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Vertex-distinguishing proper arc colorings of digraphs ⋮ Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 ⋮ Decomposition of Complete Bipartite Even Graphs into Closed Trails ⋮ A new vertex distinguishing total coloring of trees ⋮ On the chromatic edge stability index of graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Vertex-distinguishing proper edge colourings of some regular graphs ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph

Cites Work

• Strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Packing Circuits into K_N
• Vertex-distinguishing proper edge-colorings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item