Vertex-distinguishing edge colorings of graphs with degree sum conditions

DOI10.1007/s00373-010-0949-2zbMath1207.05060OpenAlexW2011200849MaRDI QIDQ607682

Bin Liu, Gui Zhen Liu

Publication date: 3 December 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0949-2

zbMATH Keywords

edge coloringdegree sumpath factorvertex-distinguishing coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the neighbour-distinguishing index of a graph
• \(r\)-strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Asymptotic behaviour of the observability of \(Q_ n\)
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• A note on Hamiltonian circuits
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• On the adjacent vertex distinguishing edge colourings of graphs
• Vertex-distinguishing proper edge-colorings
• Vertex-distinguishing edge colorings of graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• Degree sums and path-factors in graphs
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree

This page was built for publication: Vertex-distinguishing edge colorings of graphs with degree sum conditions