Graphs in which every c edges that form a tree are chords of a common cycle
Consider the k-connected graphs G in which every edges that form a particular type of induced subgraph must all be chords of a common cycle of G. Extending a few known partial results with and new results exploit the structure of the specified type of induced subgraph, with considerable success when...
| Main Author: | |
|---|---|
| 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.1832873 |