UB Paderborn / Katalog / Suche / in CDI

The Erdös-Hajnal Conjecture-A Survey

Journal of graph theory, 2014-02, Vol.75 (2), p.178-190

Chudnovsky, Maria

2014

Link zum Volltext

Verfügbarkeit prüfen

Even-hole-free graphs still have bisimplicial vertices

Journal of combinatorial theory. Series B, 2023-07, Vol.161, p.331-381

2023

Link zum Volltext

Verfügbarkeit prüfen

Proof of a conjecture of Plummer and Zha

Journal of graph theory, 2023-07, Vol.103 (3), p.437-450

2023

Link zum Volltext

Verfügbarkeit prüfen

Stable sets in flag spheres

European journal of combinatorics, 2023-05, Vol.110, p.103699, Article 103699

2023

Link zum Volltext

Verfügbarkeit prüfen

Erdős-Hajnal for cap-free graphs

Journal of combinatorial theory. Series B, 2021-11, Vol.151, p.417-434

2021

Link zum Volltext

Verfügbarkeit prüfen

Strongly perfect claw‐free graphs—A short proof

Journal of graph theory, 2021-07, Vol.97 (3), p.359-381

2021

Link zum Volltext

Verfügbarkeit prüfen

The structure of bull-free graphs II and III—A summary

Journal of combinatorial theory. Series B, 2012, Vol.102 (1), p.252-282

Chudnovsky, Maria

2012

Link zum Volltext

Verfügbarkeit prüfen

Perfect divisibility and 2‐divisibility

Journal of graph theory, 2019-01, Vol.90 (1), p.54-60

2019

Link zum Volltext

Verfügbarkeit prüfen

A short proof of the wonderful lemma

Journal of graph theory, 2018-03, Vol.87 (3), p.271-274

Chudnovsky, Maria

2018

Link zum Volltext

Verfügbarkeit prüfen

Induced equators in flag spheres

Journal of combinatorial theory. Series A, 2020-11, Vol.176, p.105283, Article 105283

2020

Link zum Volltext

Verfügbarkeit prüfen

Four-Coloring $\boldsymbol{P_6}$-Free Graphs. II. Finding an Excellent Precoloring

SIAM journal on computing, 2024-02, Vol.53 (1), p.146-187

2024

Link zum Volltext

Verfügbarkeit prüfen

Four-Coloring $P_6$-Free Graphs. I. Extending an Excellent Precoloring

SIAM journal on computing, 2024-02, Vol.53 (1), p.111-145

2024

Link zum Volltext

Verfügbarkeit prüfen

Odd Holes in Bull-Free Graphs

SIAM journal on discrete mathematics, 2018-01, Vol.32 (2), p.951-955

2018

Link zum Volltext

Verfügbarkeit prüfen

The roots of the independence polynomial of a clawfree graph

Journal of combinatorial theory. Series B, 2007-05, Vol.97 (3), p.350-357

2007

Link zum Volltext

Verfügbarkeit prüfen

List-k-Coloring H-Free Graphs for All $$k>4

Combinatorica (Budapest. 1981), 2024-05

2024

Link zum Volltext

Verfügbarkeit prüfen

List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s

Discrete mathematics, 2020-11, Vol.343 (11), Article 112086

2020

Link zum Volltext

Verfügbarkeit prüfen

The structure of bull-free graphs I—Three-edge-paths with centers and anticenters

Journal of combinatorial theory. Series B, 2012, Vol.102 (1), p.233-251

Chudnovsky, Maria

2012

Link zum Volltext

Verfügbarkeit prüfen

Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes

Combinatorica (Budapest. 1981), 2017-12, Vol.37 (6), p.1057-1072

2017

Link zum Volltext

Verfügbarkeit prüfen

Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree

Journal of combinatorial theory. Series B, 2022-11, Vol.157, p.144-175

2022

Link zum Volltext

Verfügbarkeit prüfen

Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings

Journal of combinatorial theory. Series B, 2021-09, Vol.150, p.195-243

2021

Link zum Volltext

Verfügbarkeit prüfen

Attempting perfect hypergraphs

Israel journal of mathematics, 2023-09, Vol.256 (1), p.133-151

2023

Link zum Volltext

Verfügbarkeit prüfen

3-Colorable Subclasses of $P_8$-Free Graphs

SIAM journal on discrete mathematics, 2018-01, Vol.32 (2), p.1111-1138

2018

Link zum Volltext

Verfügbarkeit prüfen

The Strong Perfect Graph Theorem

Annals of mathematics, 2006-07, Vol.164 (1), p.51-229

2006

Link zum Volltext

Verfügbarkeit prüfen

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in $\boldsymbol{H}$-Free Graphs

SIAM journal on computing, 2024-02, Vol.53 (1), p.47-86

2024

Link zum Volltext

Verfügbarkeit prüfen

Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs

Journal of graph theory, 2017-09, Vol.86 (1), p.5-41

2017

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

The Erdös-Hajnal Conjecture-A Survey

Even-hole-free graphs still have bisimplicial vertices

Proof of a conjecture of Plummer and Zha

Stable sets in flag spheres

Erdős-Hajnal for cap-free graphs

Strongly perfect claw‐free graphs—A short proof

The structure of bull-free graphs II and III—A summary

Perfect divisibility and 2‐divisibility

A short proof of the wonderful lemma

Induced equators in flag spheres

Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring

Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring

Odd Holes in Bull-Free Graphs

The roots of the independence polynomial of a clawfree graph

List-k-Coloring H-Free Graphs for All $$k>4

List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s

The structure of bull-free graphs I—Three-edge-paths with centers and anticenters

Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes

Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree

Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings

Attempting perfect hypergraphs

3-Colorable Subclasses of $P_8$-Free Graphs

The Strong Perfect Graph Theorem

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs

Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs

Suchergebnisse filtern