r-strong edge colorings of graphs
From MaRDI portal
Publication:856841
DOI10.1016/J.DISC.2004.12.027zbMATH Open1112.05035OpenAlexW2034742295MaRDI QIDQ856841FDOQ856841
Authors: N. Nosrati, S. Akbari, Hoda Bidkhori 
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
Recommendations
Cites Work
Cited In (64)
- On the inclusion chromatic index of a graph
- Two-distance vertex-distinguishing index of sparse graphs
- On the inclusion chromatic index of a Halin graph
- Neighbor-distinguishing indices of planar graphs with maximum degree ten
- Not necessarily proper total colourings which are adjacent vertex distinguishing
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
- Title not available (Why is that?)
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs
- Neighbor sum distinguishing index
- Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
- Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
- Neighbor sum distinguishing index of 2-degenerate graphs
- On the neighbor-distinguishing indices of planar graphs
- Distant sum distinguishing index of graphs
- Neighbor sum distinguishing index of subcubic graphs
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing index of sparse graphs
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
- A note on asymptotically optimal neighbour sum distinguishing colourings
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- 2-distance vertex-distinguishing index of subcubic graphs
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
- Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
- Local neighbor-distinguishing index of graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- On the computational complexity of strong edge coloring
- A note on graph coloring extensions and list-colorings
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Vertex-distinguishing edge colorings of graphs with degree sum conditions
- Distant set distinguishing edge colourings of graphs
- Title not available (Why is that?)
- Neighbor sum distinguishing coloring of some graphs
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- Strong edge-coloring of pseudo-Halin graphs
- Two-distance vertex-distinguishing index of sparse subcubic graphs
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- Edge-partitions of graphs and their neighbor-distinguishing index
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Some bounds on the neighbor-distinguishing index of graphs
- Title not available (Why is that?)
- Strict neighbor-distinguishing index of subcubic graphs
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- \(d\)-strong edge colorings of graphs
- On the adjacent vertex distinguishing edge colourings of graphs
- On generalized neighbor sum distinguishing index of planar graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- Upper bounds for adjacent vertex-distinguishing edge coloring
- Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
- On generalisations of the AVD conjecture to digraphs
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
- On the adjacent vertex-distinguishing equitable edge coloring of graphs
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- Distant set distinguishing total colourings of graphs
- Strong edge-colouring and induced matchings
This page was built for publication: \(r\)-strong edge colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856841)
