메뉴 건너뛰기




Volumn 5431 LNCS, Issue , 2009, Pages 165-176

Recognition of unigraphs through superposition of graphs : Extended abstract

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE SEQUENCE; DISJOINT SETS; EDGE-SETS; EXTENDED ABSTRACTS; LINEAR TIME; RECOGNITION ALGORITHM; VERTEX SET;

EID: 67650445957     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00202-1_15     Document Type: Conference Paper
Times cited : (6)

References (16)
  • 2
    • 77957101001 scopus 로고
    • Aggregation of inequalities integer programming
    • Chvatal, V., Hammer, P.: Aggregation of inequalities integer programming. Ann. Discrete Math. 1, 145-162 (1977)
    • (1977) Ann. Discrete Math , vol.1 , pp. 145-162
    • Chvatal, V.1    Hammer, P.2
  • 3
    • 0041630692 scopus 로고    scopus 로고
    • Matroids arisen from matrogenic graphs
    • Ding, G., Hammer, P.: Matroids arisen from matrogenic graphs. Discrete Mathematics 165-166(15), 211-217 (1997)
    • (1997) Discrete Mathematics , vol.165-166 , Issue.15 , pp. 211-217
    • Ding, G.1    Hammer, P.2
  • 6
    • 67650356040 scopus 로고    scopus 로고
    • Hakimi, S.L.: On realizability of a set of integers and the degrees of the vertices of a linear graph. J. Appl. Math. 10/ 11, 496-506/ 165-147 (1962)
    • Hakimi, S.L.: On realizability of a set of integers and the degrees of the vertices of a linear graph. J. Appl. Math. 10/ 11, 496-506/ 165-147 (1962)
  • 7
    • 84972576423 scopus 로고
    • Simple separable graphs
    • Johnson, R.H.: Simple separable graphs. Pacific Journal Math. 56(1), 143-158 (1975)
    • (1975) Pacific Journal Math , vol.56 , Issue.1 , pp. 143-158
    • Johnson, R.H.1
  • 9
    • 0347366318 scopus 로고
    • Sequences with unique realization by simple graphs
    • Koren, M.: Sequences with unique realization by simple graphs. J. of Combinatorial theory ser. B 21, 235-244 (1976)
    • (1976) J. of Combinatorial theory ser , vol.B 21 , pp. 235-244
    • Koren, M.1
  • 12
    • 0033743740 scopus 로고    scopus 로고
    • Recognizing Cographs And Threshold Graphs through a classification of their edges
    • Nikolopoulos, S.D.: Recognizing Cographs And Threshold Graphs through a classification of their edges. Information Processing Letters 75, 129-139 (2000)
    • (2000) Information Processing Letters , vol.75 , pp. 129-139
    • Nikolopoulos, S.D.1
  • 13
    • 0038410938 scopus 로고
    • The minimal integral separator of a threshold graph
    • Orlin, J.B.: The minimal integral separator of a threshold graph. Ann. Discrete Math. 1, 415-419 (1977)
    • (1977) Ann. Discrete Math , vol.1 , pp. 415-419
    • Orlin, J.B.1
  • 14
    • 67650414136 scopus 로고    scopus 로고
    • Suzdal, S., Tyshkevich, R.: (P,Q)-decomposition of graphs. Tech. Rep. Rostock: Univ. Fachbereich Informatik, II, 16 S (1999)
    • Suzdal, S., Tyshkevich, R.: (P,Q)-decomposition of graphs. Tech. Rep. Rostock: Univ. Fachbereich Informatik, II, 16 S (1999)
  • 15
    • 0038749026 scopus 로고    scopus 로고
    • Decomposition of graphical sequences and unigraphs
    • Tyshkevich, R.: Decomposition of graphical sequences and unigraphs. Discrete Math. 220, 201-238 (2000)
    • (2000) Discrete Math , vol.220 , pp. 201-238
    • Tyshkevich, R.1
  • 16
    • 0242570388 scopus 로고
    • Once more on matrogenic graphs
    • Tyshkevich, R.: Once more on matrogenic graphs. Discrete Math. 51, 91-100 (1984)
    • (1984) Discrete Math , vol.51 , pp. 91-100
    • Tyshkevich, R.1


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