Cayley partitionable graphs and near-factorizations of finite groups
From MaRDI portal
Publication:1422434
DOI10.1016/S0012-365X(03)00293-0zbMath1031.05110WikidataQ114122936 ScholiaQ114122936MaRDI QIDQ1422434
Publication date: 14 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C17: Perfect graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On circular critical graphs
- Graphical properties related to minimal imperfection
- Partitionable graphs arising from near-factorizations of finite groups
- On critical edges in minimal imperfect graphs
- Perfect zero–one matrices
- Recursive generation of partitionable graphs