Perfect graph decompositions

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Upper and lower bounds are given for the minimum number of perfect (induced or partial) subgraphs covering or partitioning the vertex set or the edge set of a graph of n vertices. Also, weighted versions of the problems are investigated.

Original languageEnglish
Pages (from-to)89-93
Number of pages5
JournalGraphs and Combinatorics
Volume7
Issue number1
DOIs
Publication statusPublished - Mar 1991

Fingerprint

Graph Decomposition
Perfect Graphs
Decomposition
Upper and Lower Bounds
Subgraph
Partitioning
Covering
Partial
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

Perfect graph decompositions. / Tuza, Z.

In: Graphs and Combinatorics, Vol. 7, No. 1, 03.1991, p. 89-93.

Research output: Contribution to journalArticle

Tuza, Z. / Perfect graph decompositions. In: Graphs and Combinatorics. 1991 ; Vol. 7, No. 1. pp. 89-93.
@article{b28973f21c214ebaa901b655ea4fcb5c,
title = "Perfect graph decompositions",
abstract = "Upper and lower bounds are given for the minimum number of perfect (induced or partial) subgraphs covering or partitioning the vertex set or the edge set of a graph of n vertices. Also, weighted versions of the problems are investigated.",
author = "Z. Tuza",
year = "1991",
month = "3",
doi = "10.1007/BF01789465",
language = "English",
volume = "7",
pages = "89--93",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

TY - JOUR

T1 - Perfect graph decompositions

AU - Tuza, Z.

PY - 1991/3

Y1 - 1991/3

N2 - Upper and lower bounds are given for the minimum number of perfect (induced or partial) subgraphs covering or partitioning the vertex set or the edge set of a graph of n vertices. Also, weighted versions of the problems are investigated.

AB - Upper and lower bounds are given for the minimum number of perfect (induced or partial) subgraphs covering or partitioning the vertex set or the edge set of a graph of n vertices. Also, weighted versions of the problems are investigated.

UR - http://www.scopus.com/inward/record.url?scp=0346834684&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346834684&partnerID=8YFLogxK

U2 - 10.1007/BF01789465

DO - 10.1007/BF01789465

M3 - Article

VL - 7

SP - 89

EP - 93

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -