Discrete Mathematics · 2010 · 20 citations · 20 references
Natural SciencesComputer ScienceMathematicsCombinatoricsComputational GeometryDiscrete MathematicsGraph AlgorithmsGraph TheoryMatching TheoryBipartite MatchingGraph MatchingMatching AlgorithmsMatching ProblemsSubgraph Isomorphism
20
Kathryn Fraughnaugh · Networks · 1997 · 1.7K citations
The NP-Completeness of Edge-Coloring
Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations
Blocking and anti-blocking pairs of polyhedra
D. R. Fulkerson · Mathematical Programming · 1971 · 540 citations
The chromatic class of a multigraph
V. G. Vizing · Cybernetics and Systems Analysis · 1965 · 185 citations