| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903120 | Discrete Mathematics | 2018 | 11 Pages |
Abstract
Our algorithms are based on our results that triangle-free odd-signable graphs have treewidth at most 5 and thus have clique-width at most 48, and that (cap, 4-hole)-free odd-signable graphs G without clique cutsets have treewidth at most 6Ï(G)â1 and clique-width at most 48.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Kathie Cameron, Murilo V.G. da Silva, Shenwei Huang, Kristina VuÅ¡koviÄ,