Cayley partitionable graphs and near-factorizations of finite groups

DOI10.1016/S0012-365X(03)00293-0zbMath1031.05110OpenAlexW1964503547WikidataQ114122936 ScholiaQ114122936MaRDI QIDQ1422434

D. Massart

Publication date: 14 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00293-0

zbMATH Keywords

Cayley graphPerfect graphGroupNear-factorizationPartitionable graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)

Related Items (1)

A Sum of Squares Characterization of Perfect Graphs

Uses Software

• GAP

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cayley partitionable graphs and near-factorizations of finite groups