Add to ORKGWe give a simple proof for an important result of Edmonds, Lovasz and Pulleyblank, stating that a brick has no non-trivial tight cuts. Our proof relies on some results on almost critical graphs. The introduction of these graphs is the second aim of the present paper. (orig.)Available from TIB Hannover: RN 4052(98865) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
A conjecture of Kaiser and Raspaud [6] asserts (in a special form due to Mácajová and Skoviera) that...
AbstractAn edge of a graph is calledcritical, if deleting it the stability number of the graph incre...
A conjecture of Mácajová and Skoviera asserts that every bridgeless cubic graph has two perfect matc...
A graph is matching covered if it connected, has at least two vertices and each of its edges is cont...
AbstractA graph is matching covered if it connected, has at least two vertices and each of its edges...
AbstractIn 1987, Lovász conjectured that every brick G different from K4, C6, and the Petersen graph...
In (M. H. de Carvalho, C. L. Lucchesi, and U. S. R. Murty, 2002, J. Combin. Theory Ser. B 85, 94-136...
AbstractIn (2001, J. Combin. Theory Ser. B) we established the validity of the main theorem (1.1) fo...
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct ver...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of per...
AbstractWe give a very simple proof that every non-bipartite matching covered graph contains a nice ...
AbstractThe perfect matching polytope of a graph G is the convex hull of the set of incidence vector...
We give a very simple proof that every non-bipartite matching covered graph contains a nice subgraph...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
A conjecture of Kaiser and Raspaud [6] asserts (in a special form due to Mácajová and Skoviera) that...
AbstractAn edge of a graph is calledcritical, if deleting it the stability number of the graph incre...
A conjecture of Mácajová and Skoviera asserts that every bridgeless cubic graph has two perfect matc...
A graph is matching covered if it connected, has at least two vertices and each of its edges is cont...
AbstractA graph is matching covered if it connected, has at least two vertices and each of its edges...
AbstractIn 1987, Lovász conjectured that every brick G different from K4, C6, and the Petersen graph...
In (M. H. de Carvalho, C. L. Lucchesi, and U. S. R. Murty, 2002, J. Combin. Theory Ser. B 85, 94-136...
AbstractIn (2001, J. Combin. Theory Ser. B) we established the validity of the main theorem (1.1) fo...
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct ver...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of per...
AbstractWe give a very simple proof that every non-bipartite matching covered graph contains a nice ...
AbstractThe perfect matching polytope of a graph G is the convex hull of the set of incidence vector...
We give a very simple proof that every non-bipartite matching covered graph contains a nice subgraph...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
A conjecture of Kaiser and Raspaud [6] asserts (in a special form due to Mácajová and Skoviera) that...
AbstractAn edge of a graph is calledcritical, if deleting it the stability number of the graph incre...
A conjecture of Mácajová and Skoviera asserts that every bridgeless cubic graph has two perfect matc...