Subgraph characterization of Red/Blue-split graph and konig egerváry graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 842-850

  Korach, Ephraim ^a   Nguyen, Thành ^b   Peis, Britta ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Department of Obstetrics Gynecology   (United States)

^c UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; LINEAR EQUATIONS; PROBLEM SOLVING;

BLUE-SPLIT GRAPH; LINEAR INEQUALITIES; SUBGRAPH CHARACTERIZATION; VERTEX COVER;

GRAPH THEORY;

EID: 33244459401     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109650     Document Type: Conference Paper

References (18)

1. M. Chudnovsky, N. Robertson, R. Thomas, P. Seymour The strong perfect graph theorem, Annals of Math, to appear
2. R. W. Deming, Independence numbers of graphs -an extension of the Konig-Egerváry theorem, Discrete Mathematics 27 (1979) 23-33.
3. Egerváry Jeno [=Eugene], Matrixok kombinatorius tulajdonságairól, [in Hungarian: On combinatorial properties of matrices] Matematikai és Fizikai Lapok, 38 (1931) 16-28.
4. U. Faigle, B. Fuchs, B. Peis, On Optimal Coverings by Colored Stable Sets, submitted.
5. S. Földes, P.L. Hammer, Split Graphs, Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Computing (F. Hoffmann et al., eds.), Lousiana State Univ., Baton Rouge, Louisiana, 1977, pp 311-315.
6. Jean-Marie Bourjolly and William R. Pulleyblank, Konig-Egervary Graphs, 2-Bicritical Graphs and Fractional Matchings, DAM 24 (1989), pp 63-82.
7. F. Gavril, An efficient solvable graph partition problem to which many problems are reducible, Information Processing Letters 45, 1993, pp. 285-290.
8. R. M. Karp, Reducibility among combinatorial problems, R. E. Miller and J. W. Thatcher, eds. Complexity of Computer Computations (Plenum, New York, 1972) pp. 85-104.
9. D. König, Gráphok és mátrixok, [in Hungarian: Graphs and matrices], Matematikai es Fizikai Lapok, 38 (1931) 116-119.
10. 4, or a Finite Basis Characterization of Non-Knig-Egerváry Graphs, Technical Report 115, IBM-Israel Scientific Center, 1982.
11. E. Korach Packing of T-cuts and Other Aspects of Dual Integrality Univ. of Waterloo, Dept. of Combinatorics and Optimization, Ph.D. Thesis, 1982.
12. K. Kuratowski, Sur le probleme des courbes gauches en topologie, Fund. Math. 15 (1930), 271-283.
13. L. Lovász, M.D. Plummer, Matching Theory, Akadémiai Kiadó-Budapest, 1986.
14. L. Lovász, Ear-decompositions of matching-covered graphs, Combinatorica 3 (1983), pp. 105-118.
15. N. Roberston and P.D. Seymour, Graph minors XX: Wagner's conjecture, J. Combinatorial Theory, Ser. B, 92 (2004), 325-357.
16. A. Schrijver, Disjoint Homotopic Paths and Trees in a Planar Grap, Discrete Computational Geometry 6, Springer-Verlag New York Inc., 1991, pp. 527-574.
17. F. Sterboul, A characterization of the graphs in which the transversal number equals the matching number, Journal of Combinatorial Theory Series B 27 (1979) 228-229.
18. K. Wagner. Uber eine Eigenschaft der ebene Komplexe, Math. Anna. 114 (1937), 570-590.