메뉴 건너뛰기




Volumn 141, Issue 1-3, 2004, Pages 185-194

Partitioning chordal graphs into independent sets and cliques

Author keywords

Chordal graphs; Greedy algorithms; List partitions; Min max theorems; Pre colouring extension; Split graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; SET THEORY; THEOREM PROVING;

EID: 2942571427     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00371-8     Document Type: Conference Paper
Times cited : (56)

References (11)
  • 2
    • 0040321449 scopus 로고    scopus 로고
    • Partitions of graphs into one or two independent sets and cliques
    • Brandstädt A. Partitions of graphs into one or two independent sets and cliques. Discrete Math. 152:1996;47-54.
    • (1996) Discrete Math. , vol.152 , pp. 47-54
    • Brandstädt, A.1
  • 3
    • 0042956665 scopus 로고    scopus 로고
    • Corrigendum: Partitions of graphs into one or two independent sets and cliques
    • Brandstädt A. Corrigendum: Partitions of graphs into one or two independent sets and cliques. Discrete Math. 186:1998;295-295.
    • (1998) Discrete Math. , vol.186 , pp. 295-295
    • Brandstädt, A.1
  • 4
    • 0041940560 scopus 로고    scopus 로고
    • The complexity of some problems related to graph 3-colorability
    • Brandstädt A., Le V.B., Szymczak T. The complexity of some problems related to graph 3-colorability. Discrete Appl. Math. 89:1998;59-73.
    • (1998) Discrete Appl. Math. , vol.89 , pp. 59-73
    • Brandstädt, A.1    Le, V.B.2    Szymczak, T.3
  • 5
    • 0042041677 scopus 로고    scopus 로고
    • r-dominating cliques in graphs with hypertree structure
    • Dragan F.F., Brandstädt A. r-dominating cliques in graphs with hypertree structure Discrete Math. 162:1996;93-108.
    • (1996) Discrete Math. , vol.162 , pp. 93-108
    • Dragan, F.F.1    Brandstädt, A.2
  • 10
    • 0031523617 scopus 로고    scopus 로고
    • Coloring precolored perfect graphs
    • Kratochvíl J., Sebö A. Coloring precolored perfect graphs. J. Graph Theory. 25:1997;207-215.
    • (1997) J. Graph Theory , vol.25 , pp. 207-215
    • Kratochvíl, J.1    Sebö, A.2
  • 11
    • 2942559105 scopus 로고    scopus 로고
    • Master Thesis, COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Brazil, (in Portuguese)
    • L.T. Nogueira, Grafos Split e Grafos Split Generalizados, Master Thesis, COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Brazil, 1999 (in Portuguese).
    • (1999) Grafos Split e Grafos Split Generalizados
    • Nogueira, L.T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.