子立方平面图的$(1,0)$-松弛强边列表染色

DOI10.11845/sxjz.2020049bOpenAlexW3209139163MaRDI QIDQ5037961

Min Chen, Jinrong Zhang, Wei Fan Wang

Publication date: 29 September 2022

Full work available at URL: http://www.oaj.pku.edu.cn/sxjz/CN/10.11845/sxjz.2020049b

zbMATH Keywords

list coloringplanar subcubic graph\((1,0)\)-relaxed strong edge \(L\)-coloring\((1,0)\)-relaxed strong edge-coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On strong list edge coloring of subcubic graphs
• Strong list edge coloring of subcubic graphs
• Strong edge-colouring of sparse planar graphs
• On \((s,t)\)-relaxed strong edge-coloring of graphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Strong chromatic index of graphs with maximum degree four
• Planar graphs with maximum degree 4 are strongly 19-edge-colorable
• Strong list-chromatic index of subcubic graphs
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• On strong edge-colouring of subcubic graphs
• List strong edge coloring of some classes of graphs
• A Stronger Bound for the Strong Chromatic Index
• Induced matchings in cubic graphs
• (1,0)-Relaxed strong edge list coloring of planar graphs with girth 6

This page was built for publication: 子立方平面图的$(1,0)$-松弛强边列表染色