Keyword

Vizing's theorem

Description: A graph theory theorem stating that the chromatic index of a simple graph is either its maximum degree or one greater.
Wikidata ID: wiki/Q2226822
OpenAlex ID: keywords/vizing-s-theorem
1992 · J. Misra, David Gries · Information Processing Letters · 222
1977 · P Erdős, Robin J Wilson · Journal of Combinatorial Theory Series B · 101
1986 · A. G. Chetwynd, A. J. W. Hilton · Mathematical Proceedings of the Cambridge Philosophical Society · 94
1981 · Mike Plantholt · Journal of Graph Theory · 86
2019 · Yi-Jun Chang, Qizheng He, et al. · ACM Transactions on Algorithms · 78
2018 · Yi-Jun Chang, Qizheng He, et al. · Society for Industrial and Applied Mathematics eBooks · 61
1973 · Lowell W. Beineke, Robin J. Wilson · Discrete Mathematics · 58
2021 · Anton Bernshteyn · Journal of Combinatorial Theory Series B · 56
1984 · Henry A Kierstead · Journal of Combinatorial Theory Series B · 55
2019 · Ilan Reuven Cohen, Binghui Peng, et al. · Annual Symposium on Foundations of Computer Science · 47
2000 · David A Grable, Alessandro Panconesi · Journal of Algorithms · 40
2016 · M. Bonamy, J. Przybyło · Journal of Graph Theory · 39
2019 · Hsin-Hao Su, Hoa T. Vu · ACM Symposium on Theory of Computing (STOC) · 38
1975 · Stanley Fiorini · Journal of Combinatorial Theory Series B · 35
1991 · Claude Berge, Jean Claude Fournier · Journal of Graph Theory · 34
1983 · Michael J. Plantholt · Discrete Mathematics · 34
2025 · Guantao Chen, Guangming Jing, et al. · Journal of Combinatorial Optimization · 33
2020 · Jan Grebík, Oleg Pikhurko · Advances in Mathematics · 33
2010 · Fabrício N. Costa, Sebastián Urrutia, et al. · Annals of Operations Research · 33
2019 · Sinnamon, Corwin · arXiv (Cornell University) · 30
2025 · Sepehr Assadi · Society for Industrial and Applied Mathematics eBooks · 29
2003 · Bert Randerath · Discrete Mathematics · 29
1994 · Thomas Niessen · Discrete Applied Mathematics · 29
Works count: 212
Citation count: 2,535
Year
Topic
Type