Labeling planar graphs with a condition at distance two - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Labeling planar graphs with a condition at distance two

Abstract

An $L(2,1)$-labeling of a graph is a mapping $c:V(G) \to \{0,\ldots,K\}$ such that the labels assigned to neighboring vertices differ by at least $2$ and the labels of vertices at distance two are different. Griggs and Yeh [SIAM J. Discrete Math. 5 (1992), 586―595] conjectured that every graph $G$ with maximum degree $\Delta$ has an $L(2,1)$-labeling with $K \leq \Delta^2$. We verify the conjecture for planar graphs with maximum degree $\Delta \neq 3$.
Fichier principal
Vignette du fichier
dmAE0109.pdf (149.24 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184374 , version 1 (14-08-2015)

Identifiers

Cite

Peter Bella, Daniel Král, Bojan Mohar, Katarina Quittnerová. Labeling planar graphs with a condition at distance two. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.41-44, ⟨10.46298/dmtcs.3417⟩. ⟨hal-01184374⟩

Collections

INSMI TDS-MACS
97 View
615 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More