2-distance vertex-distinguishing index of subcubic graphs
From MaRDI portal
Publication:724740
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
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
- Adjacent strong edge coloring of graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing proper edge-colorings
- Title not available (Why is that?)
- Irregular Assignments of Trees and Forests
- On the vertex-distinguishing proper edge-colorings of graphs
- Some bounds on the neighbor-distinguishing index of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
- Title not available (Why is that?)
- Adjacent Vertex Distinguishing Edge‐Colorings
- \(r\)-strong edge colorings of graphs
- Star edge coloring of some classes of graphs
- Star Chromatic Index
- Edge-partitions of graphs and their neighbor-distinguishing index
- Legally \((\varDelta +2)\)-coloring bipartite outerplanar graphs in cubic time
Cited In (8)
- 2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS
- A characterization of graphs with regular distance-2 graphs
- Title not available (Why is that?)
- Two-distance vertex-distinguishing index of sparse graphs
- Two-distance vertex-distinguishing index of sparse subcubic graphs
- Strict neighbor-distinguishing index of subcubic graphs
- Distance vertex-distinguishing index of outerplanar 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)
