The square of connected S(K1,3)-free graph is vertex pancyclic

Authors:
G Hendry;W Volger
Affiliations:
-;-
Venue:
Journal of Graph Theory
Year:
1985

Citing 0
Cited 3

Graphs satisfying inequality θ(G2)≤θ(G)

Discrete Mathematics
Hamiltonian paths in the square of a tree

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract