@book{7c55cc1b5fde427e9f42e63b65bec338,

title = "A characterization of extremal graphs without matching-cuts",

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|\geq \lceil 3(|V|-1)/2\rceil$, and constructed a large class of immune graphs attaining this lower bound for every value of $|V(G)|$, called ABC graphs. In this paper, we prove their conjecture that every immune graph that attains this lower bound is an ABC graph.",

keywords = "MSC-05C75, MSC-05C35, METIS-225440, IR-65953, EWI-3589",

author = "P.S. Bonsma",

note = "Imported from MEMORANDA",

year = "2005",

language = "Undefined",

isbn = "0169-2690",

series = "Memorandum Afdeling TW",

publisher = "University of Twente",

number = "1769",

address = "Netherlands",

}