Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs

DOI10.1016/J.AML.2011.05.038zbMath1234.05105OpenAlexW2094198882MaRDI QIDQ654244

Yi Qiao Wang, Wei Fan Wang

Publication date: 28 December 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.05.038

zbMATH Keywords

maximum degreeadjacent vertex-distinguishing edge coloring\(K_{4}\)-minor free graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (24)

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 ⋮ A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree ⋮ Neighbor sum distinguishing index of planar graphs ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles ⋮ An improved upper bound for the neighbor sum distinguishing index of graphs ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ 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 ⋮ Neighbor product distinguishing total colorings ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) ⋮ The algorithm for adjacent vertex distinguishing proper edge coloring of graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs ⋮ Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs ⋮ An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph ⋮ On Neighbor-Distinguishing Index of Planar Graphs ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles ⋮ Some bounds on the neighbor-distinguishing index of graphs ⋮ Neighbor sum distinguishing edge colorings of sparse graphs

Cites Work

• On the neighbour-distinguishing index of a graph
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
• Coloring the square of a \(K_{4}\)-minor free graph
• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs