EUVIMEDEUVIMED entdecken
Crossref

Facial graceful coloring of plane graphs

Július Czap

Opuscula Mathematica · 2024 · 815-825

DOI: 10.7494/opmath.2024.44.6.815 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Opuscula Mathematica, 2024. Verfasst von Július Czap. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 20 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let \(G\) be a plane graph. Two edges of \(G\) are facially adjacent if they are consecutive on the boundary walk of a face of \(G\). A facial edge coloring of \(G\) is an edge coloring such that any two facially adjacent edges receive different colors. A facial graceful \(k\)-coloring of \(G\) is a proper vertex coloring \(c:V(G)\rightarrow\{1,2,\dots,k\}\) such that the induced edge coloring \(c^{\prime}:E(G)\rightarrow\{1,2,\dots,k-1\}\) defined by \(c^{\prime(uv)}=|c(u)-c(v)|\) is a facial edge coloring. The minimum integer \(k\) for which \(G\) has a facial graceful \(k\)-coloring is denoted by \(\chi_{fg}(G)\). In this paper we prove that \(\chi_{fg}(G)\leq 14\) for every plane graph \(G\) and \(\chi_{fg}(H)\leq 9\) for every outerplane graph \(H\). Moreover, we give exact bounds for cacti and trees.

Zitieren

APA

Czap, J. (2024). Facial graceful coloring of plane graphs. Opuscula Mathematica, 815-825. https://doi.org/10.7494/opmath.2024.44.6.815

Vancouver

Czap J. Facial graceful coloring of plane graphs. Opuscula Mathematica. 2024:815-825. doi:10.7494/opmath.2024.44.6.815

BibTeX
@article{Czap2024,
  author = {Czap, Július},
  title = {Facial graceful coloring of plane graphs},
  journal = {Opuscula Mathematica},
  year = {2024},
  pages = {815--825},
  doi = {10.7494/opmath.2024.44.6.815}
}
Kostenlos starten →