Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time

DOI10.1007/978-3-319-26626-8_45zbMath1478.05146OpenAlexW2406443781MaRDI QIDQ3467875

Ko-Wei Lih, Danjun Huang, Wei Fan Wang

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_45

zbMATH Keywords

algorithmbipartite graphedge coloringouterplanar graph2-distance vertex-distinguishing index

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items

2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS ⋮ Two-distance vertex-distinguishing index of sparse subcubic graphs ⋮ 2-distance vertex-distinguishing index of subcubic graphs

Cites Work

• The surviving rate of an outerplanar graph for the firefighter problem
• \(r\)-strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Adjacent strong edge coloring of graphs
• \(L(h,1)\)-labeling subclasses of planar graphs
• Some bounds on the neighbor-distinguishing index of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Vertex-distinguishing proper edge-colorings
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item