Add to ORKGA labeled graph is said to be weakly bipartite if the clutter of its odd cycles is ideal. Seymour conjectured that a labeled graph is weakly bipartite if and only if it does not contain a minor called an odd K5 . A proof of this conjecture is given in this paper
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
We prove that if a nonbipartite graph G on n vertices has minimal degree δ≥n/(4k+2)+ck,m, where ck,m...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
AbstractA signed graph is said to be weakly bipartite if the clutter of its odd circuits is ideal. P...
A binary clutter is the family of odd circuits of a binary matroid, that is, the family of circuits ...
A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circum...
AbstractIt is proved that for every constant ϵ > 0 and every graph G on n vertices which contains no...
AbstractThe main result consists of a combinatorial characterization of weakly cyclic matrices of od...
AbstractP4-sparse graphs (defined by Hoàng) and P4-reducible graphs (defined by Jamison and Olariu) ...
Abstract. An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length...
Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. ...
In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for th...
AbstractWe prove that the non-trivial (finite or infinite) weakly median graphs which are undecompos...
We say that H has an odd complete minor of order at least l if there are l vertex disjoint trees in ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
We prove that if a nonbipartite graph G on n vertices has minimal degree δ≥n/(4k+2)+ck,m, where ck,m...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
AbstractA signed graph is said to be weakly bipartite if the clutter of its odd circuits is ideal. P...
A binary clutter is the family of odd circuits of a binary matroid, that is, the family of circuits ...
A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circum...
AbstractIt is proved that for every constant ϵ > 0 and every graph G on n vertices which contains no...
AbstractThe main result consists of a combinatorial characterization of weakly cyclic matrices of od...
AbstractP4-sparse graphs (defined by Hoàng) and P4-reducible graphs (defined by Jamison and Olariu) ...
Abstract. An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length...
Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. ...
In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for th...
AbstractWe prove that the non-trivial (finite or infinite) weakly median graphs which are undecompos...
We say that H has an odd complete minor of order at least l if there are l vertex disjoint trees in ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
We prove that if a nonbipartite graph G on n vertices has minimal degree δ≥n/(4k+2)+ck,m, where ck,m...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...