Open AccessClique packings and clique partitions of graphs without odd chordles cycles
Author(s) -
Zbigniew Lonc
Publication year - 1996
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1029
Subject(s) - mathematics , combinatorics , clique , clique sum , split graph , induced subgraph isomorphism problem , chordal graph , treewidth , clique number , clique graph , block graph , discrete mathematics , pathwidth , graph , 1 planar graph , line graph , voltage graph
In this paper we consider partitions (resp. packings) of graphs without odd chordless cycles into cliques of order at least 2. We give a structure theorem, min-max results and characterization theorems for this kind of partitions and packings.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom