SOME PROBLEMS AND RESULTS ON CIRCUIT GRAPHS AND TRIANGULAR GRAPHS

Abstract

We discuss the decomposition problems on circuit graphs and triangular graphs, and show how they can be applied to obtain results on spanning trees or hamiltonian cycles. We also prove that every circuit graph containing no separating 3-cycles can be extended by adding new edges to a triangular graph containing no separating 3-cycles.

Keywords

• Circuit graphs;
• triangular graphs;
• decompositions;
• spanning subgraphs