Add to ORKGIn matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to their connection to maximum matchings in a graph. For a root theta of the matching polynomial, we define theta-barrier and theta-extreme sets. We prove a generalized Berge-Tutte formula and give a characterization for the set of all theta-special vertices in a graph. (C) 2010 Elsevier B.V. All rights reserved
AbstractFor a graph property P, we define a P-matching as a set M of disjoint edges such that the su...
Given an undirected graph G = (V, E) with matching number v(G), we define d-blockers as subsets of e...
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
AbstractIn matching theory, barrier sets (also known as Tutte sets) have been studied extensively du...
A well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph $G$ in t...
AbstractRecently, Bauer et al. [D. Bauer, H.J. Broersma, A. Morgana, E. Schmeichel, Tutte sets in gr...
A well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph G in ter...
AbstractLet ω0(G) denote the number of odd components of a graph G. The deficiency of G is defined a...
C. Merino proved recently the following identity between evaluations of the Tutte polynomial of comp...
Motivated by the identity t(Kn+2; 1,−1) = t(Kn; 2,−1), where t(G;x, y) is the Tutte polynomial of a...
AbstractGiven an undirected graph G=(V,E) with matching number ν(G), we define d-blockers as subsets...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
A generalized-theta-graph is a graph consisting of a pair of end vertices joined by k (k ≥ 3) intern...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversa...
AbstractFor a graph property P, we define a P-matching as a set M of disjoint edges such that the su...
Given an undirected graph G = (V, E) with matching number v(G), we define d-blockers as subsets of e...
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
AbstractIn matching theory, barrier sets (also known as Tutte sets) have been studied extensively du...
A well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph $G$ in t...
AbstractRecently, Bauer et al. [D. Bauer, H.J. Broersma, A. Morgana, E. Schmeichel, Tutte sets in gr...
A well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph G in ter...
AbstractLet ω0(G) denote the number of odd components of a graph G. The deficiency of G is defined a...
C. Merino proved recently the following identity between evaluations of the Tutte polynomial of comp...
Motivated by the identity t(Kn+2; 1,−1) = t(Kn; 2,−1), where t(G;x, y) is the Tutte polynomial of a...
AbstractGiven an undirected graph G=(V,E) with matching number ν(G), we define d-blockers as subsets...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
A generalized-theta-graph is a graph consisting of a pair of end vertices joined by k (k ≥ 3) intern...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversa...
AbstractFor a graph property P, we define a P-matching as a set M of disjoint edges such that the su...
Given an undirected graph G = (V, E) with matching number v(G), we define d-blockers as subsets of e...
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...