Adjacent vertex distinguishing indices of planar graphs without 3-cycles
DOI10.1016/J.DISC.2014.10.010zbMATH Open1305.05053OpenAlexW2056792956MaRDI QIDQ482220FDOQ482220
Authors: Danjun Huang, Zhengke Miao, Weifan Wang 
Publication date: 19 December 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.10.010
Recommendations
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
- A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
- Adjacent vertex distinguishing index of bipartite planar graphs
- On the neighbor-distinguishing indices of planar graphs
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Adjacent strong edge coloring of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On the neighbour-distinguishing index of a graph
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
Cited In (8)
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
- A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
- Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)
- Title not available (Why is that?)
- Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles
- Neighbor-distinguishing indices of planar graphs with maximum degree ten
- Adjacent vertex distinguishing index of bipartite planar graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
This page was built for publication: Adjacent vertex distinguishing indices of planar graphs without 3-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482220)
