Result: Partitionable graphs arising from near-factorizations of finite groups
Title:
Partitionable graphs arising from near-factorizations of finite groups
Authors:
Contributors:
Pêcher, Arnaud
Source:
Discrete Mathematics. 269:191-218
Publisher Information:
Elsevier BV, 2003.
Publication Year:
2003
Subject Terms:
Perfect graphs, partitionable graph, Partitionable graph, 0102 computer and information sciences, 01 natural sciences, Graphs and abstract algebra (groups, rings, fields, etc.), Theoretical Computer Science, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], near-factorization group, Perfect graph, perfect graph, Discrete Mathematics and Combinatorics, Group, Near-factorization, 0101 mathematics, Arithmetic and combinatorial problems involving abstract finite groups
Document Type:
Academic journal
Article
File Description:
application/xml; application/pdf
Language:
English
ISSN:
0012-365X
DOI:
10.1016/s0012-365x(02)00755-0
Access URL:
Rights:
Elsevier Non-Commercial
Accession Number:
edsair.doi.dedup.....4d3db995d95768a3d9d787436c1f039c
Database:
OpenAIRE
Further Information
zbMATH Open Web Interface contents unavailable due to conflicting licenses.