On Neighbor-Distinguishing Index of Planar Graphs

DOI10.1002/JGT.21764MaRDI QIDQ5495886zbMATH OpenOpenAlexFDO

Authors Mirko Horňák, Danjun Huang, Weifan Wang

Publication date 7 August 2014

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.21764

zbMATH Keywords

color setneighbor-distinguishing edge coloringneighbor-distinguishing indexplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the neighbor-distinguishing indices of planar graphs
• On the neighbor sum distinguishing index of planar graphs
• On generalized neighbor sum distinguishing index of planar graphs
• Neighbor sum distinguishing index of planar graphs
• On the neighbour-distinguishing index of a graph
• Some bounds on the neighbor-distinguishing index of graphs
• Neighbor-distinguishing indices of planar graphs with maximum degree ten
• A note on the neighbour-distinguishing index of digraphs
• General neighbour-distinguishing index of a graph
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree

Cites work

• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex distinguishing edge-colorings of meshes
• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• Neighbour-distinguishing edge colourings of random regular graphs
• On the neighbour-distinguishing index of a graph

Cited in

(37)

• Neighbor sum distinguishing index of 2-degenerate graphs
• On the neighbour sum distinguishing index of graphs with bounded maximum average degree
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Distant sum distinguishing index of graphs
• Neighbor sum distinguishing index of subcubic graphs
• On the neighbor-distinguishing indices of planar graphs
• Adjacent vertex distinguishing edge coloring of IC-planar graphs
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Neighbor sum distinguishing index of sparse graphs
• Some bounds on the neighbor-distinguishing index of graphs
• Edge colorings of the direct product of two graphs
• Neighbor sum distinguishing edge colorings of sparse graphs
• Edge-partitions of graphs and their neighbor-distinguishing index
• General neighbour-distinguishing index of a graph
• Neighbor sum distinguishing index of \(K_4\)-minor free graphs
• Strict neighbor-distinguishing index of subcubic graphs
• Neighbor-distinguishing indices of planar graphs with maximum degree ten
• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
• Local neighbor-distinguishing index of graphs
• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
• scientific article; zbMATH DE number 6712567 (Why is no real title available?)
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• Legally \((\varDelta +2)\)-coloring bipartite outerplanar graphs in cubic time
• Neighbor sum distinguishing index of planar graphs
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles
• On the neighbor sum distinguishing index of planar graphs
• Progress on the adjacent vertex distinguishing edge coloring conjecture
• Neighbor sum distinguishing edge coloring of subcubic graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
• On the inclusion chromatic index of a graph
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
• Neighbor sum distinguishing index of K₄-minor free graphs
• Neighbor-distinguishing index of IC-planar graphs
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
• On the neighbour-distinguishing index of a graph

This page was built for publication: On Neighbor-Distinguishing Index of Planar Graphs

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