Efficient Algorithms for (3,1) Graphs

DOI10.1016/0020-0255(77)90009-3zbMath0364.05036OpenAlexW2054343363MaRDI QIDQ1240742

Walter A. Burkhard, Ann Marie Walsh

Publication date: 1977

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(77)90009-3

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Algorithms in computer science (68W99)

Cites Work

• A note on Hamiltonian circuits
• Paths, Trees, and Flowers
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Permutation Graphs and Transitive Graphs
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Algorithms for (3,1) Graphs