Catlin’s reduced graphs with small orders
A graph is supereulerian if it has a spanning closed trail. Catlin in 1990 raised the problem of determining the reduced nonsupereulerian graphs with small orders, as such results are of particular importance in the study of Eulerian subgraphs and Hamiltonian line graphs. We determine all reduced gr...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-10-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09728600.2020.1832875 |