Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Harary, Frank
and
Schwenk, Allen J.
1973.
The number of caterpillars.
Discrete Mathematics,
Vol. 6,
Issue. 4,
p.
359.
Lesniak, Linda
1973.
Graphs with 1-Hamiltonian-connected cubes.
Journal of Combinatorial Theory, Series B,
Vol. 14,
Issue. 2,
p.
148.
Harary, Frank
1974.
Graphs and Combinatorics.
Vol. 406,
Issue. ,
p.
1.
Fleischner, Herbert
and
Hobbs, Arthur M.
1975.
Hamiltonian Total Graphs.
Mathematische Nachrichten,
Vol. 68,
Issue. 1,
p.
59.
Fleischner, Herbert
and
Hobbs, Arthur M
1975.
A necessary condition for the square of a graph to be Hamiltonian.
Journal of Combinatorial Theory, Series B,
Vol. 19,
Issue. 2,
p.
97.
Lesniak‐Foster, L.
1977.
Some recent results in hamiltonian graphs.
Journal of Graph Theory,
Vol. 1,
Issue. 1,
p.
27.
Hobbs, Arthur M.
1978.
Theory and Applications of Graphs.
Vol. 642,
Issue. ,
p.
271.
Hobbs, Arthur M
1979.
Hamiltonian squares of cacti.
Journal of Combinatorial Theory, Series B,
Vol. 26,
Issue. 1,
p.
50.
Trotter, William T.
and
Harary, Frank
1979.
On double and multiple interval graphs.
Journal of Graph Theory,
Vol. 3,
Issue. 3,
p.
205.
Harary, Frank
and
Kabell, Jerald A.
1980.
An Intuitive Approach to Interval Numbers of Graphs.
Mathematics Magazine,
Vol. 53,
Issue. 1,
p.
39.
Lauri, J.
1983.
Proof of Harary's conjecture on the reconstruction of trees.
Discrete Mathematics,
Vol. 43,
Issue. 1,
p.
79.
Matthews, M. M.
and
Sumner, D. P.
1984.
Hamiltonian results in K1,3‐free graphs.
Journal of Graph Theory,
Vol. 8,
Issue. 1,
p.
139.
Gould, Ronald J.
and
Jacobson, Michael S.
1984.
Forbidden subgraphs and hamiitonian properties in the square of a connected graph.
Journal of Graph Theory,
Vol. 8,
Issue. 1,
p.
147.
Proskurowski, Andrzej
1984.
Separating subgraphs in k-trees: Cables and caterpillars.
Discrete Mathematics,
Vol. 49,
Issue. 3,
p.
275.
Hedetniemi, Sandra M
Proskurowski, Andrzej
and
Sysło, Maciej M
1985.
Interior graphs of maximal outerplane graphs.
Journal of Combinatorial Theory, Series B,
Vol. 38,
Issue. 2,
p.
156.
Hendry, George
and
Vogler, Walter
1985.
The square of a connected S(K1,3)‐free graph is vertex pancyclic.
Journal of Graph Theory,
Vol. 9,
Issue. 4,
p.
535.
El-Basil, Sherif
1987.
Applications of caterpillar trees in chemistry and physics.
Journal of Mathematical Chemistry,
Vol. 1,
Issue. 2,
p.
153.
Traczyk, Tomasz
1988.
A dirac‐type theorem for squares of graphs.
Journal of Graph Theory,
Vol. 12,
Issue. 4,
p.
463.
Randić, Milan
Hosoya, Haruo
and
Polansky, Oskar E.
1989.
On the construction of the matching polynomial for unbranched catacondensed benzenoids.
Journal of Computational Chemistry,
Vol. 10,
Issue. 5,
p.
683.
Lin, Yaw-Ling
and
Skiena, Steven S.
1991.
ISA'91 Algorithms.
Vol. 557,
Issue. ,
p.
12.