AbstractIn this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, sufficient to imply that a 2-connected graph of sufficiently large order is hamiltonian
AbstractMatthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order ...
This research paper was completed and submitted at Nipissing University, and is made freely accessib...
We introduce a new class of graphs which we call P₃-dominated graphs. This class properly contains a...
AbstractIn this paper we characterize all triples of connected graphs C,X,Y (where C is a claw) and ...
AbstractIn this paper we characterize those forbidden triples of graphs, no one of which is a genera...
AbstractIn this paper we characterize all triples of connected graphs C,X,Y (where C is a claw) and ...
It is proven that if $G$ is a $3$-connected claw-free graph which is also $Z_3$-free (where $Z_3$ is...
It is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of ...
grantor: University of TorontoA graph 'G' is called claw-free if it does not contain a cop...
grantor: University of TorontoA graph 'G' is called claw-free if it does not contain a cop...
AbstractLet G be a claw-free graph and let cl(G) be the closure of G. We present a method for charac...
AbstractA graph G is called quasi-claw-free if it satisfies the property: d(x,y)=2 ⇒ there exists u∈...
AbstractA graph G is called quasi-claw-free if it satisfies the property: d(x,y)=2⇒ there exists u∈N...
In [2], Brousek characterizes all triples of connected graphs, G1, G2, G3, with Gi = K1,3 for some i...
AbstractWe study the stability of some classes of graphs defined in terms of forbidden subgraphs und...
AbstractMatthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order ...
This research paper was completed and submitted at Nipissing University, and is made freely accessib...
We introduce a new class of graphs which we call P₃-dominated graphs. This class properly contains a...
AbstractIn this paper we characterize all triples of connected graphs C,X,Y (where C is a claw) and ...
AbstractIn this paper we characterize those forbidden triples of graphs, no one of which is a genera...
AbstractIn this paper we characterize all triples of connected graphs C,X,Y (where C is a claw) and ...
It is proven that if $G$ is a $3$-connected claw-free graph which is also $Z_3$-free (where $Z_3$ is...
It is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of ...
grantor: University of TorontoA graph 'G' is called claw-free if it does not contain a cop...
grantor: University of TorontoA graph 'G' is called claw-free if it does not contain a cop...
AbstractLet G be a claw-free graph and let cl(G) be the closure of G. We present a method for charac...
AbstractA graph G is called quasi-claw-free if it satisfies the property: d(x,y)=2 ⇒ there exists u∈...
AbstractA graph G is called quasi-claw-free if it satisfies the property: d(x,y)=2⇒ there exists u∈N...
In [2], Brousek characterizes all triples of connected graphs, G1, G2, G3, with Gi = K1,3 for some i...
AbstractWe study the stability of some classes of graphs defined in terms of forbidden subgraphs und...
AbstractMatthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order ...
This research paper was completed and submitted at Nipissing University, and is made freely accessib...
We introduce a new class of graphs which we call P₃-dominated graphs. This class properly contains a...
DOI
Add to ORKG