An algorithm for identifying cycle-plus-triangles graphs
From MaRDI portal
Publication:2357769
Recommendations
Cites work
- A solution to a colouring problem of P. Erdős
- An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
- Combinatorial Nullstellensatz
- scientific article; zbMATH DE number 25254 (Why is no real title available?)
- scientific article; zbMATH DE number 524136 (Why is no real title available?)
- scientific article; zbMATH DE number 970801 (Why is no real title available?)
- The Hamiltonian property of consecutive-\(d\) digraphs
Cited in
(7)- Independence number of 2-factor-plus-triangles graphs
- The complexity of finding fair independent sets in cycles
- scientific article; zbMATH DE number 524136 (Why is no real title available?)
- On finding constrained independent sets in cycles
- The cycle discrepancy of three-regular graphs
- An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
- The complexity of finding fair independent sets in cycles
This page was built for publication: An algorithm for identifying cycle-plus-triangles graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357769)