Name
Abstract | ||
|---|---|---|
Let G be a Berge graph such that no induced subgraph is a 4-cycle or a line-graph of a bipartite subdivision of K4. We show that every such graph G either is a complete graph or has an even pair. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jctb.2018.01.003 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Perfect graphs,Berge graphs,Square-free,Prisms,Even pairs | Complete graph,Graph,Combinatorics,Square-free integer,Bipartite graph,Induced subgraph,Subdivision,Mathematics | Journal |
Volume | ISSN | Citations |
131 | 0095-8956 | 0 |
PageRank | References | Authors |
0.34 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maria Chudnovsky | 1 | 390 | 46.13 |
| Frédéric Maffray | 2 | 589 | 81.22 |
| Paul D. Seymour | 3 | 2786 | 314.49 |
| Sophie Theresa Spirkl | 4 | 8 | 7.36 |