AbstractIn 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 θ of the matching polynomial, we define θ-barrier and θ-extreme sets. We prove a generalized Berge–Tutte formula and give a characterization for the set of all θ-special vertices in a graph
The number of vertices missed by a maximum matching in a graph G is the multiplicity of zero as a r...
AbstractIn 1958, Claude Berge studied the domination number γ(G) of a graph and showed that every gr...
AbstractGiven an undirected graph G=(V,E) with matching number ν(G), we define d-blockers as subsets...
AbstractIn matching theory, barrier sets (also known as Tutte sets) have been studied extensively du...
In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to the...
AbstractGodsil observed the simple fact that the multiplicity of 0 as a root of the matching polynom...
AbstractRecently, Bauer et al. [D. Bauer, H.J. Broersma, A. Morgana, E. Schmeichel, Tutte sets in gr...
AbstractLet ω0(G) denote the number of odd components of a graph G. The deficiency of G is defined a...
AbstractA matching M is uniquely restricted in a graph G if its saturated vertices induce a subgraph...
In decomposition theory, extreme sets have been studied extensively due to its connection to perfect...
AbstractFor a finite undirected graph G=(V,E) and positive integer k≥1, an edge set M⊆E is a distanc...
AbstractA maximum stable setin a graph G is a stable set of maximum cardinality. The set S is called...
AbstractFor i=2,3 and a cubic graph G let νi(G) denote the maximum number of edges that can be cover...
AbstractWe prove that every graph G of maximum degree at most 3 satisfies 32α(G)+α′(G)+12t(G)≥n(G), ...
AbstractWe present a short proof of the Berge–Tutte Formula and the Gallai–Edmonds Structure Theorem...
The number of vertices missed by a maximum matching in a graph G is the multiplicity of zero as a r...
AbstractIn 1958, Claude Berge studied the domination number γ(G) of a graph and showed that every gr...
AbstractGiven an undirected graph G=(V,E) with matching number ν(G), we define d-blockers as subsets...
AbstractIn matching theory, barrier sets (also known as Tutte sets) have been studied extensively du...
In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to the...
AbstractGodsil observed the simple fact that the multiplicity of 0 as a root of the matching polynom...
AbstractRecently, Bauer et al. [D. Bauer, H.J. Broersma, A. Morgana, E. Schmeichel, Tutte sets in gr...
AbstractLet ω0(G) denote the number of odd components of a graph G. The deficiency of G is defined a...
AbstractA matching M is uniquely restricted in a graph G if its saturated vertices induce a subgraph...
In decomposition theory, extreme sets have been studied extensively due to its connection to perfect...
AbstractFor a finite undirected graph G=(V,E) and positive integer k≥1, an edge set M⊆E is a distanc...
AbstractA maximum stable setin a graph G is a stable set of maximum cardinality. The set S is called...
AbstractFor i=2,3 and a cubic graph G let νi(G) denote the maximum number of edges that can be cover...
AbstractWe prove that every graph G of maximum degree at most 3 satisfies 32α(G)+α′(G)+12t(G)≥n(G), ...
AbstractWe present a short proof of the Berge–Tutte Formula and the Gallai–Edmonds Structure Theorem...
The number of vertices missed by a maximum matching in a graph G is the multiplicity of zero as a r...
AbstractIn 1958, Claude Berge studied the domination number γ(G) of a graph and showed that every gr...
AbstractGiven an undirected graph G=(V,E) with matching number ν(G), we define d-blockers as subsets...
DOI
Add to ORKG