60 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR16 papers
- University of LeedsGB16 papers
- Laboratoire de l'Informatique du ParallélismeFR14 papers
- École Normale Supérieure de LyonFR13 papers
- Institut national de recherche en sciences et technologies du numériqueFR6 papers
- Université de LyonFR6 papers
- University of BelgradeRS6 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR4 papers
- Lyon 1 UniversitéFR4 papers
- Princeton UniversityUS3 papers
- Université Paris DiderotFR2 papers
- University of Novi SadRS2 papers
3 papers · 2 filters
The (theta, wheel)-free graphs Part III: cliques, stable sets and coloring
Marko Radovanović, Nicolas Trotignon, Kristina Vušković
A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the…
Triangle-free graphs that do not contain an induced subdivision of are 3-colorable
Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt +3
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K4 are 3-colorable. This proves a conjecture of Trotignon and Vuskovic.
The (theta, wheel)-free graphs Part II: structure theorem
Marko Radovanović, Nicolas Trotignon, Kristina Vušković
A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the paths induces a hole. A wheel is a graph formed by a hole an…