Graph structural properties of non-Yutsis graphs allowing fast recognition

Discrete Applied Mathematics

Volumn 157, Issue 2, 2009, Pages 377-386

  Aldred, Robert E L ^a   Van Dyck, Dries ^b   Brinkmann, Gunnar ^c   Fack, Veerle ^c   McKay, Brendan D ^d  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b HASSELT UNIVERSITY   (Belgium)

^c GHENT UNIVERSITY   (Belgium)

^d AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Decision problem; Dual Hamiltonian graph; General recoupling coefficient; Yutsis graph

Indexed keywords

GRAPH THEORY; HAMILTONIANS; HEURISTIC METHODS; NUCLEAR PROPULSION; QUANTUM THEORY;

BENCHMARKING ALGORITHMS; CONSTRUCTION TECHNIQUES; CUBIC GRAPHS; DECISION PROBLEM; DECISION PROBLEMS; DUAL HAMILTONIAN GRAPH; DUAL HAMILTONIAN GRAPHS; EXPERIMENTAL EVIDENCES; FAST RECOGNITIONS; FAST TECHNIQUES; GENERAL RECOUPLING COEFFICIENT; GENERAL RECOUPLING COEFFICIENTS; SIMPLE GRAPHS; YUTSIS GRAPH; YUTSIS GRAPHS;

TREES (MATHEMATICS);

EID: 56349164321     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.03.020     Document Type: Article

References (13)

1. Biedenharn L.C., and Louck J.D. Coupling of n Angular Momenta: Recoupling Theory. The Racah-Wigner Algebra in Quantum Theory, Encyclopedia of Mathematics and its Applications vol. 9 (1981), Addison-Wesley 435-481
2. A.P. Yutsis, I.B. Levinson, V.V. Vanagas, Mathematical Apparatus of the Theory of Angular Momentum, Israel Program for Scientific Translation, Jerusalem, 1962
3. Van Dyck D., and Fack V. On the reduction of Yutsis graphs. Discrete Mathematics 307 11-12 (2007) 1506-1515
4. F. Jaeger, On vertex-induced forests in cubic graphs, in: Proc. 5th Southeastern Conference, Congressus Numerantium, 1974, pp. 501-512
5. Jackson B., and Whitehead C.A. Some remarks on Jaeger's dual-Hamiltonian conjecture. Annales de l'Institut Fourier 49 3 (1999) 921-926
6. Diestel R. Graph Theory. third edn (2005), Springer pp. 46-49
7. Van Dyck D., Brinkmann G., Fack V., and McKay B.D. To be or not to be Yutsis: algorithms for the decision problem. Computer Physics Communications 173 (2005) 61-70
8. Wormald N.C. The asymptotic connectivity of labelled regular graphs. Journal of Combinatorial Theory. Series B 31 2 (1981) 156-167
9. Nedela R., and Skoviera M. Atoms of cyclic connectivity in cubic graphs. Mathematica Slovaca 45 5 (1995) 481-499
10. Richmond L.B., Robinson R.W., and Wormald N.C. On Hamilton cycles in 3-connected cubic maps. In: Alspach B., and Godsil C.D. (Eds). Annals of Discrete Mathematics. Cycles in Graphs vol. 27 (1985), North-Holland 141-150
11. Richmond L.B., and Wormald N.C. Random triangulations of the plane. European Journal of Combinatorics 9 (1988) 61-71
12. Brinkmann G. Fast generation of cubic graphs. Journal of Graph Theory 23 2 (1996) 139-149
13. B.D. McKay, nauty 2.2 http://cs.anu.edu.au/~bdm/nauty/