\(r\)-strong edge colorings of graphs
From MaRDI portal
Publication:856841
DOI10.1016/j.disc.2004.12.027zbMath1112.05035OpenAlexW2034742295MaRDI QIDQ856841
N. Nosrati, Hoda Bidkhori, Saieed Akbari
Publication date: 14 December 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.12.027
Related Items (55)
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ Distant set distinguishing total colourings of graphs ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) ⋮ Strict neighbor-distinguishing index of subcubic graphs ⋮ On generalisations of the AVD conjecture to digraphs ⋮ Neighbor sum distinguishing index ⋮ On generalized neighbor sum distinguishing index of planar graphs ⋮ Edge-partitions of graphs and their neighbor-distinguishing index ⋮ Vertex-distinguishing edge colorings of graphs with degree sum conditions ⋮ Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound ⋮ On the adjacent vertex-distinguishing equitable edge coloring of graphs ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ Neighbor sum distinguishing index of planar graphs ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles ⋮ Two-distance vertex-distinguishing index of sparse subcubic graphs ⋮ Distant set distinguishing edge colourings of graphs ⋮ An improved upper bound for the neighbor sum distinguishing index of graphs ⋮ On the inclusion chromatic index of a graph ⋮ Neighbor sum distinguishing index of sparse 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 ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ \(d\)-strong edge colorings of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) ⋮ NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS ⋮ Adjacent vertex distinguishing colorings by sum of sparse graphs ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ On the adjacent vertex distinguishing edge colourings of graphs ⋮ Unnamed Item ⋮ Distant sum distinguishing index of graphs ⋮ Neighbor sum distinguishing index of subcubic graphs ⋮ Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree ⋮ Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs ⋮ Some bounds on the neighbor-distinguishing index of graphs ⋮ Not necessarily proper total colourings which are adjacent vertex distinguishing ⋮ Neighbor sum distinguishing edge colorings of sparse graphs ⋮ On the neighbor-distinguishing indices of planar graphs
Cites Work
This page was built for publication: \(r\)-strong edge colorings of graphs
