scientific article; zbMATH DE number 3641471

zbMath0413.05029MaRDI QIDQ4200086

Gustavus J. Simmons

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bipartite graphHamilton pathrectangular latticesHamilton laceable

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Edge-bipancyclicity of star graphs under edge-fault tolerant ⋮ Bipartite independent number and Hamilton-biconnectedness of bipartite graphs ⋮ Hyper-Hamilton laceable and caterpillar-spannable product graphs ⋮ Matching preclusion for balanced hypercubes ⋮ Mutually independent bipanconnected property of hypercube ⋮ Star transposition Gray codes for multiset permutations ⋮ Hamiltonian laceability in hypercubes with faulty edges ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube ⋮ The spanning laceability on the faulty bipartite hypercube-like networks ⋮ Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes ⋮ Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes ⋮ Hamiltonian cycles in hypercubes with faulty edges ⋮ Hamiltonicity of hypercubes with a constraint of required and faulty edges ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs ⋮ Fault-tolerant Hamiltonian laceability of balanced hypercubes ⋮ Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position ⋮ Some results on topological properties of folded hypercubes ⋮ The spanning connectivity of folded hypercubes ⋮ On the spanning connectivity and spanning laceability of hypercube-like networks ⋮ A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults ⋮ On the bipanpositionable bipanconnectedness of hypercubes ⋮ Long paths in hypercubes with conditional node-faults ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ Reconfiguring vertex colourings of 2-trees ⋮ Linear array and ring embeddings in conditional faulty hypercubes ⋮ Survey on path and cycle embedding in some networks ⋮ Path embeddings with prescribed edge in the balanced hypercube network ⋮ Fault-tolerant Hamiltonian laceability of hypercubes. ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids ⋮ Minimal hyper-Hamilton laceable graphs