Vertex-distinguishing edge colorings of graphs with degree sum conditions

DOI10.1007/S00373-010-0949-2MaRDI QIDQ607682zbMATH OpenOpenAlexFDO

Authors Bin Liu, Guizhen 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

vertex-distinguishing coloringdegree sumedge coloringpath factor

Mathematics Subject Classification ID

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

Recommendations

• On vertex-distinguishing proper edge colorings of graphs satisfying the Ore condition.
• Vertex-distinguishing proper edge-colorings
• A note on the vertex-distinguishing proper edge coloring of graphs.
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
• A conjecture of a vertex-distinguishing edge coloring of graphs

Cites work

• scientific article; zbMATH DE number 844141 (Why is no real title available?)
• scientific article; zbMATH DE number 907924 (Why is no real title available?)
• A note on Hamiltonian circuits
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent strong edge coloring of graphs
• Asymptotic behaviour of the observability of \(Q_ n\)
• Degree sums and path-factors in graphs
• Graph theory with applications
• On the adjacent vertex distinguishing edge colourings of graphs
• On the neighbour-distinguishing index of a graph
• On the vertex-distinguishing proper edge-colorings of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Vertex-distinguishing edge colorings of graphs
• Vertex-distinguishing proper edge-colorings
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• \(r\)-strong edge colorings of graphs

Cited in

(10)

• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
• Edge-colouring graphs with bounded local degree sums
• A conjecture of a vertex-distinguishing edge coloring of graphs
• Vertex‐distinguishing edge colorings of random graphs
• Vertex neighborhood restricted edge achromatic sums of graphs
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
• A note on the vertex-distinguishing proper edge coloring of graphs.
• On vertex-distinguishing proper edge colorings of graphs satisfying the Ore condition.
• scientific article; zbMATH DE number 6613818 (Why is no real title available?)
• A Vizing-like theorem for union vertex-distinguishing edge coloring

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

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