Edge-disjoint Hamilton cycles in 4-regular planar graphs-Reference-Cited by-同舟云学术

Edge-disjoint Hamilton cycles in 4-regular planar graphs

Published:1981-12 Issue:1 Volume:22 Page:42-45
ISSN:0001-9054
Container-title:Aequationes Mathematicae
language:en
Short-container-title:Aeq. Math.

Author:

Bondy J. A.,Häggkvist R.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics,General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF02190157.pdf

Reference8 articles.

1. Grinberg, E.,Plane homogeneous graphs of degree three without Hamiltonian circuits. (Russian. Latvian and English summaries) Latvian Math. Yearbook, Izdat. “Zinatne”, Riga4 (1968), 51–58.

2. Grünbaum, B. andMalkevitch, J.,Pairs of edge-disjoint Hamiltonian circuits. Aequationes Math.14 (1976), 191–196.

3. Grünbaum, B. andZaks, J.,The existence of certain planar maps. Discrete Math.10 (1974), 93–115.

4. Kotzig, A.,Aus der Theorie der endlichen regulären Graphen dritten und vierten Grades. (Slovak. Russian and German summaries) Časopis Pěst. Mat.82 (1957), 76–92.

5. Martin, P.,Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes. Aequationes Math.14 (1976), 37–40.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Grinberg’s Criterion;European Journal of Combinatorics;2019-01

2. Regular non-hamiltonian polyhedral graphs;Applied Mathematics and Computation;2018-12

3. Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits;Discrete Mathematics;2012-08

4. Balanced generic circuits without long paths;Discrete Mathematics;2012-08

5. Some basic properties of multiple Hamiltonian covers;Discrete Applied Mathematics;2006-08