Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three

DOI10.1016/0898-1221(84)90065-8zbMath0569.05044OpenAlexW2039256573WikidataQ126588386 ScholiaQ126588386MaRDI QIDQ1061146

K. Szymanski, J. V. Knop, P. Křivka, Nenad Trinajstić

Publication date: 1984

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(84)90065-8

zbMATH Keywords

algorithm1-factorsenumeratingFORTRANlisting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Theory of monomer-dimer systems
• On the theory of the matching polynomial

This page was built for publication: Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three