EUVIMEDEUVIMED entdecken
Crossref

Equitable colorings of some cycle-based middle graphs

Dalibor Froncek

Congressus Numerantium · 22.06.2026 · 237 · 79-92

DOI: 10.61091/cn237-05 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Congressus Numerantium, online erschienen am 22.06.2026. Verfasst von Dalibor Froncek.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

An equitable vertex \(k\)-coloring of a graph \(G\) is a proper vertex coloring with \(k\) colors such that the size of any two color classes differ by at most one. It was conjectured by Meyer in 1973 that every graph other than the complete graph \(K_n\) or an odd cycle \(C_{2m+1}\) admits an equitable vertex coloring with at most \(\Delta(G)\) colors, where \(\Delta(G)\) is the maximum degree of a vertex in graph \(G\). We show that the conjecture is true for middle graphs of some cycle-based graphs.

Zitieren

APA

Froncek, D. (2026). Equitable colorings of some cycle-based middle graphs. Congressus Numerantium, 237, 79-92. https://doi.org/10.61091/cn237-05

Vancouver

Froncek D. Equitable colorings of some cycle-based middle graphs. Congressus Numerantium. 2026;237:79-92. doi:10.61091/cn237-05

BibTeX
@article{Froncek2026,
  author = {Froncek, Dalibor},
  title = {Equitable colorings of some cycle-based middle graphs},
  journal = {Congressus Numerantium},
  year = {2026},
  volume = {237},
  pages = {79--92},
  doi = {10.61091/cn237-05}
}
Kostenlos starten →