A characterization of extremal graphs with no matching-cut

Share/Save/Bookmark

Bonsma, Paul (2005) A characterization of extremal graphs with no matching-cut. In: European Conference on Combinatorics, Graph Theory and Applications, EuroComb '05, September 5-9, 2009, Berlin, Germany.

[img]
Preview
PDF
112Kb
Abstract:A graph is called (matching-)immune if it has no edge cut that is also a matching. Farley and Proskurowski proved that for all immune graphs G=(V,E) , |E|≥⌈3(|V|-1)/2⌉ , and constructed a large class of immune graphs that attain this lower bound for every value of |V(G)| , called ABC graphs. They conjectured that every immune graph that attains this lower bound is an ABC graph. We present a proof of this conjecture.
Item Type:Conference or Workshop Item
Copyright:© 2005 DMTCS
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/72727
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 226878