Mathematical Proceedings of the Cambridge Philosophical Society · 1975 · 28 citations · 4 references
Natural SciencesComputer ScienceMathematicsCircuit TheoryCombinatoricsTheory Of ComputationGraph AlgorithmsGraph ColoringGraph TheoryValency ClassesValency Theory
Abstract In papers (7, 8), Vizing studied graphs which are critical with respect to edge colourings. In particular, he obtained bounds on the number of edges and on the circuit length of such graphs in terms of its maximum valency. The object of this paper is to improve these bounds by obtaining others which also take into account the order of the graph.
4
SOME UNSOLVED PROBLEMS IN GRAPH THEORY
V. G. Vizing · Russian Mathematical Surveys · 1968 · 436 citations
The chromatic class of a multigraph
V. G. Vizing · Cybernetics and Systems Analysis · 1965 · 185 citations
On the edge-chromatic number of a graph
Lowell W. Beineke, Robin Wilson · Discrete Mathematics · 1973 · 50 citations