Counterexamples to Two Conjectures on Mean Color Numbers of Graphs
Journal of Graph Theory · 2026-09 · 113 (1) · 57-60
DOI: 10.1002/jgt.70050 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 23.04.2026. Verfasst von Wushuang Zhai und 1 weiteren Autor:innen. Die Arbeit nennt 7 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
The mean color number of an ‐vertex graph , denoted by , is the average number of colors used in all proper ‐colorings of . For any graph and any vertex in , Dong (2003) conjectured that (1) ; (2) if is not an isolated vertex, then , where is a graph obtained from by deleting all but one of the edges incident to . We disprove these two conjectures by providing an infinite family of counterexamples.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Zhai, W., & Yang, Y. (2026). Counterexamples to Two Conjectures on Mean Color Numbers of Graphs. Journal of Graph Theory, 113(1), 57-60. https://doi.org/10.1002/jgt.70050
Vancouver
Zhai W, Yang Y. Counterexamples to Two Conjectures on Mean Color Numbers of Graphs. Journal of Graph Theory. 2026;113(1):57-60. doi:10.1002/jgt.70050
BibTeX
@article{Zhai2026,
author = {Zhai, Wushuang and Yang, Yan},
title = {Counterexamples to Two Conjectures on Mean Color Numbers of Graphs},
journal = {Journal of Graph Theory},
year = {2026},
volume = {113},
number = {1},
pages = {57--60},
doi = {10.1002/jgt.70050}
}
EUVIMED