@inproceedings{df02f84804fe433c9ea7a3a5d96e1c3b,
title = "A characterization of extremal graphs with no matching-cut",
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.",
keywords = "IR-72727, METIS-226878, matching immune, extremal graphs, Matching-cut",
author = "P.S. Bonsma",
year = "2005",
language = "Undefined",
series = "DMTCS Proceedings Series",
publisher = "DMTCS",
pages = "135--138",
editor = "S. Felsner",
booktitle = "European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)",
note = "European Conference on Combinatorics, Graph Theory and Applications, EuroComb \'05 ; Conference date: 05-09-2009 Through 09-09-2009",
}