Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture

By M. Stiebitz, Diego Scheide, B. Toft, Lene M. Favrholdt. 2012

122 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/2ad0df18c4cc29f33b6a4e0eba8d931d4cf491a1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Deryk Osthus
2. D. Kühn
3. Allan Siu Lun Lo
4. Peter Keevash
5. Richard Mycroft
6. Yi Zhao
7. Jie Han

In Management Science and Operations Research

1. D. Kühn
2. John C. Duchi
3. Hongseok Namkoong
4. Peyman Mohajerin Esfahani
5. Soroosh Shafieezadeh-Abadeh
6. Hamed Rahimian
7. Sanjay Mehrotra
8. Ioannis Ch. Paschalidis

Citations in the corpus

• Proof of the 1-factorization and Hamilton Decomposition Conjectures (2014, background): “In general, it is a very difficult problem to determine which graphs G attain the (trivial) lower bound ∆ – much of the recent book [31] is devoted to the subject.”