The list L(2,1)-labeling of planar graphs with large girth

DOI10.1007/978-3-030-57602-8_45MaRDI QIDQ2039710zbMATH OpenOpenAlexFDO

Authors Zhu Haiyang, Zhu Junlei, Liu Ying, Wang Shuling, Huang Danjun, Miao Lianying

Publication date 5 July 2021

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

zbMATH Keywords

1)\)-labeling number\(L(2,1)\)-labelinggirthlist \(L(2planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• The List L(2, 1)-labeling of planar graphs
• Optimal frequency assignment and planar list L(2, 1)-labeling
• On list (2,1)-labeling of some planar graphs.
• The L(2,1)-labeling of planar graphs with maximum degree at most six
• Labeling planar graphs with a condition at distance two

Cites work

• A bound on the chromatic number of the square of a planar graph
• A Theorem about the Channel Assignment Problem
• Coloring the square of a planar graph
• Combinatorial Nullstellensatz
• Graph theory with applications
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
• Labeling planar graphs with a condition at distance two
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Labeling planar graphs without 4,5-cycles with a condition on distance two
• Labelling Graphs with a Condition at Distance 2
• Labelling planar graphs without 4-cycles with a condition on distance two
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• Neighbor sum distinguishing index of subcubic graphs
• On the \(L(p,1)\)-labelling of graphs
• Optimal channel assignment and \(L(p,1)\)-labeling
• The $L(2,1)$-Labeling Problem on Graphs
• The L(2,1)-labelling of trees
• The L(p, q)-labelling of planar graphs without 4-cycles
• The List L(2, 1)-labeling of planar graphs

Cited in

(7)

• The List L(2, 1)-labeling of planar graphs
• Optimal frequency assignment and planar list L(2, 1)-labeling
• (d,1)-total labelling of planar graphs with large girth and high maximum degree
• On list (2,1)-labeling of some planar graphs.
• The List L (p,q)-labelings of planar graphs with high maximum degree
• List injective coloring of planar graphs with disjoint 5^--cycles
• Planar graphs without intersecting 5-cycles are signed-4-choosable

This page was built for publication: The list \(L(2,1)\)-labeling of planar graphs with large girth

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