Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with =9, 10, or 11

DOI10.1016/J.IPL.2014.09.025zbMATH Open1304.05023OpenAlexW2027629310MaRDI QIDQ477654FDOQ477654

Zepeng Li, Xiang'en Chen

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.025

Recommendations

• Adjacent vertex distinguishing index of bipartite planar graphs
• Adjacent-vertex-distinguishing total coloring of planar bipartite graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree

zbMATH Keywords

combinatorial problemsplanar bipartite graphsadjacent-vertex-distinguishing proper edge chromatic numberadjacent-vertex-distinguishing proper edge coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• On the vertex-distinguishing proper edge-colorings of graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• On the neighbour-distinguishing index of a graph

Cited In (3)

• AVD proper edge-coloring of some families of graphs
• Upper bounds for adjacent vertex-distinguishing edge coloring
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9

This page was built for publication: Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477654)