Work

(Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels

Year: 2021

Type: article

Abstract: We present a construction called layered wheel. Layered wheels are graphs of arbitrarily large treewidth and girth. They might be an outcome for a possible theorem characterizing graphs with large treewidth in terms of their induced subgraphs (while such a characterization is well‐understood in terms of minors). They also provide examples of graphs of large treewidth and large rankwidth in well‐studied classes, such as (theta, triangle)‐free graphs and even‐hole‐free graphs with no (where a hole is a chordless cycle of length at least four, a theta is a graph made of three internally vertex disjoint paths of length at least two linking two vertices, and is the complete graph on four vertices).

Source: Journal of Graph Theory

DOI: 10.1002/jgt.22666

Authors: Ni Luh Dewi Sintiari, Nicolas Trotignon

Institutions: Lyon 1 Université, École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Laboratoire de l'Informatique du Parallélisme

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Agence Nationale de la Recherche

Awards: Community of mathematics and fundamental computer science in Lyon, Digraphs