A note on the edge-connectivity of cages.
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ioan Tomescu (2001)
Matematički Vesnik
Similarity:
Chartrand, Gary, Saba, Farrokh, Wormald, Nicholas C. (1984)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Wojciech Wide (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2. For a given graph H we say that G is H-f1-heavy if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K), dK(u, v) = 2 implies that at least one of them is super-heavy. For a family of graphs H we say that G is H-f1-heavy, if G is H-f1-heavy for...
Hetyei, Gábor (1999)
Mathematica Pannonica
Similarity:
Bohdan Zelinka (1968)
Časopis pro pěstování matematiky
Similarity:
Ladislav Stacho (2002)
Mathematica Slovaca
Similarity: