๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Factor-Critical Graphs with Given Number of Maximum Matchings

โœ Scribed by Yan Liu; Guiying Yan


Publisher
Springer Japan
Year
2008
Tongue
English
Weight
156 KB
Volume
24
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The maximum interval number of graphs wi
โœ Edward R. Scheinerman ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB ๐Ÿ‘ 1 views

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investiga