Adjacent strong edge coloring of graphs
From MaRDI portal
Publication:1609524
DOI10.1016/S0893-9659(02)80015-5zbMath1008.05050OpenAlexW2080071328MaRDI QIDQ1609524
Linzhong Liu, Jian-fang Wang, Zhong Fu Zhang
Publication date: 15 August 2002
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0893-9659(02)80015-5
Related Items (only showing first 100 items - show all)
A note on graph proper total colorings with many distinguishing constraints ⋮ 2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS ⋮ Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ AVD proper edge-coloring of some families of graphs ⋮ 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 ⋮ On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs ⋮ Adjacent vertex distinguishing total colorings of 2-degenerate graphs ⋮ Adjacent vertex distinguishing edge coloring of IC-planar graphs ⋮ Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 ⋮ Distant set distinguishing total colourings of graphs ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ A note on the neighbour-distinguishing index of digraphs ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree ⋮ On the neighbour-distinguishing index of a graph ⋮ \(r\)-strong edge colorings of graphs ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ \(D(\beta)\)-vertex-distinguishing total coloring of graphs ⋮ 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 ⋮ Edge-partitions of graphs and their neighbor-distinguishing index ⋮ The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs ⋮ 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 ⋮ AVD-edge coloring on powers of paths ⋮ 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 ⋮ 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 ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ A note on adjacent strong edge coloring of \(K(n,m)\) ⋮ Local neighbor-distinguishing index of graphs ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ The adjacent vertex distinguishing total chromatic number ⋮ 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 ⋮ On defected colourings of graphs ⋮ Distant total sum distinguishing index of graphs ⋮ \(d\)-strong edge colorings of graphs ⋮ Unnamed Item ⋮ On the adjacent vertex-distinguishing acyclic edge coloring of some graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Strongly set-colorable graphs ⋮ AVDTC numbers of generalized Halin graphs with maximum degree at least 6 ⋮ Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs ⋮ On the adjacent-vertex-strongly-distinguishing total coloring of graphs ⋮ Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) ⋮ On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) ⋮ Adjacent vertex distinguishing indices of planar graphs without 3-cycles ⋮ Unnamed Item ⋮ Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five ⋮ On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) ⋮ NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS ⋮ Adjacent vertex distinguishing colorings by sum of sparse graphs ⋮ General neighbour-distinguishing index of a graph ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ On the adjacent vertex distinguishing edge colourings of graphs ⋮ Neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Unnamed Item ⋮ General neighbour-distinguishing index via chromatic number ⋮ 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 ⋮ The algorithm for adjacent vertex distinguishing proper edge coloring of graphs ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs ⋮ Inclusion total chromatic number ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ Concise proofs for adjacent vertex-distinguishing total colorings ⋮ On \(S\)-packing edge-colorings of graphs with small edge weight ⋮ An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph ⋮ Adjacent strong edge colorings and total colorings of regular graphs ⋮ Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs ⋮ A new type of edge-derived vertex coloring ⋮ \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number ⋮ General vertex-distinguishing total coloring of graphs ⋮ On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs ⋮ AVD-total-colouring of complete equipartite graphs ⋮ On neighbour-distinguishing colourings from lists ⋮ Some bounds on the neighbor-distinguishing index of graphs ⋮ Not necessarily proper total colourings which are adjacent vertex distinguishing ⋮ Edge colorings of the direct product of two graphs ⋮ Neighbor sum distinguishing edge colorings of sparse graphs ⋮ On the neighbor-distinguishing indices of planar graphs
Cites Work
This page was built for publication: Adjacent strong edge coloring of graphs
