AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-tough graphs have k-factors if they satisfy trivial necessary conditions. In this paper, we introduce a variation of toughness, and prove a stronger result for the existence of 1- or 2-factors. This solves a conjecture of Liu and Yu, affirmatively
Let G be a graph with vertex set V (G) and edge set E(G). The isolated toughness of G is defined as ...
For a graph G with vertex set V (G) and edge set E(G), let i(G) be the number of isolated vertices i...
We define a new invariant tB(G) in bipartite graphs that is analogous to the toughness t(G) and we g...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
AbstractFor an undirected graph G, a variation of toughness is defined asτ(G)≔min|S|w(G−S)−1w(G−S)⩾2...
We define a new invariant tBG in bipartite graphs that is analogous to the toughness tG and we giv...
AbstractThe toughness of a graph G, t(G), is defined as t(G)=min{|S|/ω(G-S)|S⊆V(G),ω(G-S)>1} where ω...
AbstractIn this paper we generalize a Theorem of Jung which shows that 1-tough graphs with δ(G)⩾|V(G...
Let $G$ be a graph and let $f$ be a positive integer-valued function on $V(G)$ satisfying $2m\le f\l...
AbstractThe toughness of a graph G, denoted by t(G), is defined as the largest real number t such th...
AgraphG is chordal if it contains no chordless cycle of length at least four and is k-chordal if a l...
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a...
We define a new invariant tB(G) in bipartite graphs that is analogous to the toughness t(G) and we g...
AbstractA graph G is chordal if it contains no chordless cycle of length at least four and is k-chor...
In this survey we have attempted to bring together most of the results and papers that deal with tou...
Let G be a graph with vertex set V (G) and edge set E(G). The isolated toughness of G is defined as ...
For a graph G with vertex set V (G) and edge set E(G), let i(G) be the number of isolated vertices i...
We define a new invariant tB(G) in bipartite graphs that is analogous to the toughness t(G) and we g...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
AbstractFor an undirected graph G, a variation of toughness is defined asτ(G)≔min|S|w(G−S)−1w(G−S)⩾2...
We define a new invariant tBG in bipartite graphs that is analogous to the toughness tG and we giv...
AbstractThe toughness of a graph G, t(G), is defined as t(G)=min{|S|/ω(G-S)|S⊆V(G),ω(G-S)>1} where ω...
AbstractIn this paper we generalize a Theorem of Jung which shows that 1-tough graphs with δ(G)⩾|V(G...
Let $G$ be a graph and let $f$ be a positive integer-valued function on $V(G)$ satisfying $2m\le f\l...
AbstractThe toughness of a graph G, denoted by t(G), is defined as the largest real number t such th...
AgraphG is chordal if it contains no chordless cycle of length at least four and is k-chordal if a l...
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a...
We define a new invariant tB(G) in bipartite graphs that is analogous to the toughness t(G) and we g...
AbstractA graph G is chordal if it contains no chordless cycle of length at least four and is k-chor...
In this survey we have attempted to bring together most of the results and papers that deal with tou...
Let G be a graph with vertex set V (G) and edge set E(G). The isolated toughness of G is defined as ...
For a graph G with vertex set V (G) and edge set E(G), let i(G) be the number of isolated vertices i...
We define a new invariant tB(G) in bipartite graphs that is analogous to the toughness t(G) and we g...
DOI
Add to ORKG