Edge-partitions of graphs and their neighbor-distinguishing index

DOI10.1016/j.disc.2017.07.005zbMath1370.05175OpenAlexW2739740560MaRDI QIDQ2404402

Bojan Vučković

Publication date: 18 September 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.07.005

zbMATH Keywords

maximum degreeedge-partitionneighbor-distinguishing edge coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (11)

Strict neighbor-distinguishing index of subcubic graphs ⋮ Two-distance vertex-distinguishing index of sparse subcubic graphs ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 ⋮ Local neighbor-distinguishing index of graphs ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles ⋮ On the neighbor-distinguishing indices of planar graphs

Cites Work

• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
• \(r\)-strong edge colorings of graphs
• Adjacent strong edge coloring of graphs
• Some bounds on the neighbor-distinguishing index of graphs
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: Edge-partitions of graphs and their neighbor-distinguishing index