2-distance vertex-distinguishing index of subcubic graphs

DOI10.1007/S10878-018-0288-4zbMATH Open1398.05077OpenAlexW2796309086MaRDI QIDQ724740FDOQ724740

Authors Victor Loumngam Kamga, Ying Wang, Min Chen, Weifan 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

subcubic graphedge colouring2-distance vertex-distinguishing index

Mathematics Subject Classification ID

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

Recommendations

• Two-distance vertex-distinguishing index of sparse subcubic graphs
• 2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS
• Strict neighbor-distinguishing index of subcubic graphs
• Neighbor sum distinguishing index of subcubic graphs
• Distance vertex-distinguishing index of outerplanar graphs
• scientific article; zbMATH DE number 1029226
• scientific article; zbMATH DE number 2204182
• 2-distance vertex-distinguishing total coloring of graphs
• An upper bound on the distinguishing index of graphs with minimum degree at least two
• Distant sum distinguishing index of graphs with bounded minimum degree

Cites work

• scientific article; zbMATH DE number 5174935 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent strong edge coloring of graphs
• Edge-partitions of graphs and their neighbor-distinguishing index
• Irregular Assignments of Trees and Forests
• Legally \((\varDelta +2)\)-coloring bipartite outerplanar graphs in cubic time
• On the vertex-distinguishing proper edge-colorings of graphs
• Some bounds on the neighbor-distinguishing index of graphs
• Star Chromatic Index
• Star edge coloring of some classes of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• 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

(8)

• 2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS
• Two-distance vertex-distinguishing index of sparse graphs
• scientific article; zbMATH DE number 2204182 (Why is no real title available?)
• A characterization of graphs with regular distance-2 graphs
• Strict neighbor-distinguishing index of subcubic graphs
• Distance vertex-distinguishing index of outerplanar graphs
• Two-distance vertex-distinguishing index of sparse subcubic graphs
• Optimal \(r\)-dynamic coloring of sparse graphs

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

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