Adjacent vertex-distinguishing edge colorings of K₄-minor free graphs
From MaRDI portal
Publication:654244
Recommendations
- Adjacent Vertex Distinguishing Edge‐Colorings
- Neighbor sum distinguishing edge colorings of \({K_4}\)-minor free graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs
- Adjacent vertex distinguishing index of graphs with maximum degree six
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 planar graphs with girth at least six
- Adjacent Vertex Distinguishing Edge‐Colorings
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
- Coloring the square of a \(K_{4}\)-minor free graph
- On the neighbour-distinguishing index of a graph
Cited in
(32)- Distance constrained labelings of \(K_{4}\)-minor free graphs
- Upper bounds for adjacent vertex-distinguishing edge coloring
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
- Some bounds on the neighbor-distinguishing index of graphs
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- A relaxed case on 1-2-3 conjecture
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor-distinguishing indices of planar graphs with maximum degree ten
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
- Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_4\vee K_n\)
- Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs
- A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
- scientific article; zbMATH DE number 7594599 (Why is no real title available?)
- Neighbor product distinguishing total colorings
- On Neighbor-Distinguishing Index of Planar Graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- Neighbor product distinguishing total coloring via combinatorial Nullstellensatz
- Neighbor sum distinguishing index of K₄-minor free graphs
- An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
- Strict neighbor-distinguishing index of outerplanar 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
This page was built for publication: Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654244)
