Graph-Theoretic Concepts in Computer Science

From MaRDI portal

Publication:5902507

Jump to:navigation, search

DOI10.1007/b93953zbMath1255.05152MaRDI QIDQ5902507

Alexander Schrijver

Publication date: 12 January 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

survey paper edge colouring regular bipartite graphs counting perfect matchings finding perfect matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Packing and covering with balls on Busemann surfaces ⋮ On a matching arrangement of a graph and \(LP\)-orientations of a matching polyhedron ⋮ Counting integer points of flow polytopes

This page was built for publication: Graph-Theoretic Concepts in Computer Science

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5902507&oldid=17110979"