UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

The Erdös-Hajnal Conjecture-A Survey

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

Chudnovsky, Maria

2014

Volltextzugriff (PDF)

Even-hole-free graphs still have bisimplicial vertices

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

2023

Volltextzugriff (PDF)

Proof of a conjecture of Plummer and Zha

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

2023

Volltextzugriff (PDF)

Perfect divisibility and 2‐divisibility

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

2019

Volltextzugriff (PDF)

Stable sets in flag spheres

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

2023

Volltextzugriff (PDF)

Erdős-Hajnal for cap-free graphs

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

2021

Volltextzugriff (PDF)

Strongly perfect claw‐free graphs—A short proof

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

2021

Volltextzugriff (PDF)

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

Volltextzugriff (PDF)

A short proof of the wonderful lemma

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

Chudnovsky, Maria

2018

Volltextzugriff (PDF)

Induced equators in flag spheres

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

2020

Volltextzugriff (PDF)

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

Volltextzugriff (PDF)

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

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

2024

Volltextzugriff (PDF)

The Structure of Metrizable Graphs

Discrete & computational geometry, 2024-08

2024

Volltextzugriff (PDF)

Odd Holes in Bull-Free Graphs

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

2018

Volltextzugriff (PDF)

Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole

European journal of combinatorics, 2025-02, Vol.124, p.104074, Article 104074

2025

Volltextzugriff (PDF)

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

Volltextzugriff (PDF)

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

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

2020

Volltextzugriff (PDF)

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

Volltextzugriff (PDF)

Detecting an Odd Hole

Journal of the ACM, 2020-01, Vol.67 (1), p.1-12

2020

Volltextzugriff (PDF)

The Strong Perfect Graph Theorem

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

2006

Volltextzugriff (PDF)

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

Volltextzugriff (PDF)

Pure pairs. I. Trees and linear anticomplete pairs

Advances in mathematics (New York. 1965), 2020-12, Vol.375, p.107396, Article 107396

2020

Volltextzugriff (PDF)

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

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

2017

Volltextzugriff (PDF)

3-Colorable Subclasses of $P_8$-Free Graphs

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

2018

Volltextzugriff (PDF)

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

Volltextzugriff (PDF)

1 – 25 von 186

Suche als RSS-Feed

Aktive Filter

PublikationsformArtikel

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(182)
Mit Volltextzugriff
(184)

Sprache

Englisch
(182)
Spanisch
(4)

Erscheinungsjahr

n.n

Thema

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 90 Tagen
(2)

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

Perfect divisibility and 2‐divisibility

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

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

The Structure of Metrizable Graphs

Odd Holes in Bull-Free Graphs

Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole

The roots of the independence polynomial of a clawfree graph

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

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

Detecting an Odd Hole

The Strong Perfect Graph Theorem

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

Pure pairs. I. Trees and linear anticomplete pairs

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

3-Colorable Subclasses of $P_8$-Free Graphs

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

Aktive Filter

Suchergebnisse filtern