- Full text PDF available (18)
- This year (0)
- Last 5 years (15)
- Last 10 years (32)
Journals and Conferences
Gallai and Edmonds independently obtained a canonical decomposition of graphs in terms of their maximum matchings. Unfortunately, one of the degenerate cases for their theory occurs when the graph in… (More)
Plummer, M.D., Extending matchings in planar graphs IV, Discrete Mathematics 109 (1992) 207-219. The structure of certain non-Zextendable planar graphs is studied first. In particular, 4-connected… (More)
Hadwiger’s Conjecture seems difficult to attack, even in the very special case of graphs G of independence number α(G) = 2. We present some results in this special case.