See this document in CiteSeerX!

Critical and Anticritical Edges in Perfect Graphs (2000)  (Make Corrections)  
Annegret Wagler
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
zib.de/pub/zibpublicatio...ZR0049.ps
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  zib.de/paperweb...=2000&pubtype=1 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We call an edge e of a perfect graph G critical if G e is imperfect and say further that e is anticritical with respect to the complementary graph G. We ask in which perfect graphs critical and anticritical edges occur and how to nd critical and anticritical edges in perfect graphs. Finally, we study whether we can order the edges of certain perfect graphs such that deleting all the edges yields a sequence of perfect graphs ending up with a stable set. 1 Introduction The present paper... (Update)

Similar documents based on text:   More   All
1.2:   Wing-Triangulated Graphs are Perfect - Hougardy, Le, Wagler (1996)   (Correct)
1.1:   Perfect graphs with unique P4-structure - Hougardy (1996)   (Correct)
1.1:   On the P4-Structure of Perfect Graphs: V. Overlap Graphs - Hoàng, Hougardy..   (Correct)

BibTeX entry:   (Update)

@article{ wagler01critical,
    author = "Annegret Wagler",
    title = "Critical and Anticritical Edges in Perfect Graphs",
    journal = "Lecture Notes in Computer Science",
    volume = "2204",
    pages = "317--??",
    year = "2001",
    url = "citeseer.ist.psu.edu/wagler00critical.html" }
Citations (may not include all citations):
50   Weakly Triangulated Graphs (context) - Hayward - 1985
38   Perfect Zero-One Matrices (context) - Padberg - 1974
28   deren ungerade Kreise starr sind (context) - Berge, arbungen et al. - 1961
24   Star-Cutsets and Perfect Graphs (context) - Chv - 1985
19   A New Property of Critical Imperfect Graphs and some Consequ.. (context) - Meyniel - 1987
18   Algorithms for Weakly Triangulated Graphs (context) - Spinrad, Sritharan - 1995
10   Strongly Perfect Graphs (context) - Berge, Duchet - 1984
10   Generating Weakly Triangulated Graphs - Hayward - 1996
10   Bull-Free Berge Graphs are Perfect (context) - Chv, Sbihi - 1987
9   Coloring Perfect (context) - Tucker - 1987
8   Normal Hypergraphs and the Weak Perfect Graph Conjecture (context) - Lov - 1972
7   No Antitwins in Minimal Imperfect Graphs (context) - Olariu - 1988
6   The Perfect Graph Conjecture (context) - Meyniel - 1976
6   The Strong Perfect Graph Conjecture is True for K 1;3 -free .. (context) - Parthasarathy, Ravindra - 1976
5   Critical Perfect Graphs and Perfect 3-chromatic Graphs (context) - Tucker - 1977

[Article contains additional citations not shown here]

Documents on the same site (http://www.zib.de/paperweb/paperweb?year=2000&pubtype=1):   More
Computer-aided design of novel siderophores.. - Meyer, Schnurre.. (2000)   (Correct)
The Online-TSP Against Fair Adversaries - Blom, Krumke, De Paepe, Stougie (2000)   (Correct)
Affine Invariant Convergence Analysis for Inexact Augmented.. - Volkwein, WEISER (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC