Generating simple near‐bipartite bricks

A brick is a 3‐connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick G is near‐bipartite if it has a pair of edges α and β such that G−{α,β} is bipartite and matching covered; examples are K4 and the triangular prism C6¯. The signi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2020-12, Vol.95 (4), p.594-637
Hauptverfasser:	Kothari, Nishad, Carvalho, Marcelo H.
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes brick generation Bricks Graph matching Graph theory matching covered near‐bipartite Theorems thin edge
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!