2-distance vertex-distinguishing index of subcubic graphs

DOI10.1007/s10878-018-0288-4zbMath1398.05077OpenAlexW2796309086MaRDI QIDQ724740

Ying Wang, Min Chen, Victor Loumngam Kamga, Wei Fan Wang

Publication date: 26 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0288-4

zbMATH Keywords

edge colouringsubcubic graph2-distance vertex-distinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (4)

2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS ⋮ Two-distance vertex-distinguishing index of sparse subcubic graphs ⋮ Optimal \(r\)-dynamic coloring of sparse graphs ⋮ A characterization of graphs with regular distance-2 graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
• \(r\)-strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Some bounds on the neighbor-distinguishing index of graphs
• Edge-partitions of graphs and their neighbor-distinguishing index
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Star Edge Coloring of Some Classes of Graphs
• Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time
• Irregular Assignments of Trees and Forests
• Vertex-distinguishing proper edge-colorings
• Star Chromatic Index
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: 2-distance vertex-distinguishing index of subcubic graphs