Clique packings and clique partitions of graphs without odd chordless cycles

Zbigniew Lonc

Discussiones Mathematicae Graph Theory (1996)

  • Volume: 16, Issue: 2, page 143-149
  • ISSN: 2083-5892

Abstract

top
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.

How to cite

top

Zbigniew Lonc. "Clique packings and clique partitions of graphs without odd chordless cycles." Discussiones Mathematicae Graph Theory 16.2 (1996): 143-149. <http://eudml.org/doc/270199>.

@article{ZbigniewLonc1996,
abstract = {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.},
author = {Zbigniew Lonc},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {clique partition; matching; min-max theorems; cliques; min-max results; characterization; partitions; packings},
language = {eng},
number = {2},
pages = {143-149},
title = {Clique packings and clique partitions of graphs without odd chordless cycles},
url = {http://eudml.org/doc/270199},
volume = {16},
year = {1996},
}

TY - JOUR
AU - Zbigniew Lonc
TI - Clique packings and clique partitions of graphs without odd chordless cycles
JO - Discussiones Mathematicae Graph Theory
PY - 1996
VL - 16
IS - 2
SP - 143
EP - 149
AB - 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.
LA - eng
KW - clique partition; matching; min-max theorems; cliques; min-max results; characterization; partitions; packings
UR - http://eudml.org/doc/270199
ER -

References

top
  1. [1] G. Cornuéjols, D. Hartvigsen and W. Pulleyblank, Packings subgraphs in a graph, Operations Research Letters 1 (1982) 139-143, doi: 10.1016/0167-6377(82)90016-5. Zbl0488.90070
  2. [2] P. Hell and D.G. Kirkpatrick, On the complexity of general graph factor problems, SIAM Journal of Computing 12 (1983) 601-609, doi: 10.1137/0212040. Zbl0525.68023
  3. [3] P. Hell and D.G. Kirkpatrick, Packing by cliques and by finite families of graphs, Discrete Math. 49 (1984) 45-59, doi: 10.1016/0012-365X(84)90150-X. Zbl0582.05046
  4. [4] Z. Lonc, Chain partitions of ordered sets, Order 11 (1994) 343-351, doi: 10.1007/BF01108766. Zbl0816.06004
  5. [5] L. Lovász and M.D. Plummer, Matching Theory (North Holland, Amsterdam, 1986). 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.