A characterization of extremal graphs with no matching-cut - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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|≥\lceil 3(|V|-1)/2\rceil$ , 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.
Fichier principal
Vignette du fichier
dmAE0127.pdf (118.65 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184354 , version 1 (14-08-2015)

Identifiers

Cite

Paul Bonsma. A characterization of extremal graphs with no matching-cut. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.135-138, ⟨10.46298/dmtcs.3398⟩. ⟨hal-01184354⟩

Collections

TDS-MACS
38 View
564 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More