| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5776768 | Discrete Mathematics | 2017 | 6 Pages |
Abstract
A graph G is Î3-closed provided any two vertices of G that are joined by three internally disjoint paths are adjacent. We show that the Î3-closed graphs are precisely those that can be obtained by gluing together cliques and cycles along vertices or edges.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Robert E. Jamison, Henry Martyn Mulder,