메뉴 건너뛰기




Volumn 81, Issue 1-3, 1998, Pages 141-154

Polyhedral characterizations and perfection of line graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0041854633     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(97)00081-4     Document Type: Article
Times cited : (7)

References (14)
  • 1
    • 0007203121 scopus 로고
    • Graphe représentatif des arêtes d'un multigraphe
    • P.J.C. Bermond, J.C. Meyer, Graphe représentatif des arêtes d'un multigraphe, J. Math. Pures Appl. 52 (1973) 299-308.
    • (1973) J. Math. Pures Appl. , vol.52 , pp. 299-308
    • Bermond, P.J.C.1    Meyer, J.C.2
  • 3
    • 0001214263 scopus 로고
    • Maximum matching and a polyhedron with 0-1 vertices
    • J. Edmonds, Maximum matching and a polyhedron with 0-1 vertices, J. Res. Nat. Bur. Standards B 69 (1965) 125-130.
    • (1965) J. Res. Nat. Bur. Standards B , vol.69 , pp. 125-130
    • Edmonds, J.1
  • 6
    • 0002485541 scopus 로고
    • Line graphs and line digraphs
    • L.W. Beineke, R.J. Wilson (Eds.), Academic Press, New York
    • R.L. Hemminger, L.W. Beineke, Line graphs and line digraphs, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory I, Academic Press, New York, 1978.
    • (1978) Selected Topics in Graph Theory I
    • Hemminger, R.L.1    Beineke, L.W.2
  • 7
    • 0042960493 scopus 로고
    • On graphs whose least eigenvalue exceeds -1 - √2
    • A.J. Hoffman, On graphs whose least eigenvalue exceeds -1 - √2, Linear Algebra Appl. 16 (1977) 153-165.
    • (1977) Linear Algebra Appl. , vol.16 , pp. 153-165
    • Hoffman, A.J.1
  • 8
    • 0000204804 scopus 로고
    • A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
    • W.L. Hsu, Y. Ikura, G.L. Nemhauser, A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles, Math. Programm. 20 (1981) 225-232.
    • (1981) Math. Programm. , vol.20 , pp. 225-232
    • Hsu, W.L.1    Ikura, Y.2    Nemhauser, G.L.3
  • 10
    • 84974861933 scopus 로고
    • A strong cutting plane/branch-and-bound algorithm for node packing
    • G.L. Nemhauser, G. Sigismondi, A strong cutting plane/branch-and-bound algorithm for node packing, J. Oper. Res. Soc. 43 (1992) 443-457.
    • (1992) J. Oper. Res. Soc. , vol.43 , pp. 443-457
    • Nemhauser, G.L.1    Sigismondi, G.2
  • 13
    • 0015670780 scopus 로고
    • A max {m, n} algorithm for determining the graph H from its line graph G
    • N.D. Roussopoudos, A max {m, n} algorithm for determining the graph H from its line graph G, Inform. Process. Lett. 2 (1973) 108-112.
    • (1973) Inform. Process. Lett. , vol.2 , pp. 108-112
    • Roussopoudos, N.D.1
  • 14
    • 0006753237 scopus 로고
    • Line perfect graphs
    • L.E. Trotter Jr., Line perfect graphs, Math. Programm. 12 (1977) 255-259.
    • (1977) Math. Programm. , vol.12 , pp. 255-259
    • Trotter L.E., Jr.1


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