A canonical representation of trivalent hamiltonian graphs

DOI10.1002/JGT.3190010111MaRDI QIDQ4133660zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Robert Frucht

Publication date 1977

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190010111

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 786143
• On the construction and enumeration of Hamiltonian graphs
• Hamilton cycles in Trivalent Cayley graphs
• scientific article; zbMATH DE number 3908475
• scientific article; zbMATH DE number 3959473

Cites work

• Graphs of Degree Three with a Given Abstract Group
• HOW TO DESCRIBE A GRAPH

Cited in

(11)

• On cycle lengths in claw-free graphs with complete closure
• The Gray graph revisited
• Efficient domination in Cayley graphs of generalized dihedral groups
• A census of semisymmetric cubic graphs on up to 768 vertices
• Hamilton-connectivity of line graphs with application to their detour index
• Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
• Interconnection networks for parallel molecular dynamics simulation based on Hamiltonian cubic symmetric topology
• Infinite families of vertex-transitive graphs with prescribed Hamilton compression
• Hamiltonicity of vertex-transitive graphs of order 4\(p\)
• The 10-cages and derived configurations
• On the Laplacian and signless Laplacian polynomials of graphs with semiregular automorphisms

This page was built for publication: A canonical representation of trivalent hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133660)