AbstractWe call a chordless path v1v2…vi simplicial if it does not extend into any chordless path v0v1v2…vivi+1. Trivially, for every positive integer k, a graph contains no chordless cycle of length k+3 or more if each of its nonempty induced subgraphs contains a simplicial path with at most k vertices; we prove the converse. The case of k=1 is a classic result of Dirac
A graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal (chorda...
The biclique problem asks, given a graph G and a parameter k, whether G has a complete bipartite sub...
AbstractLet G be a graph on n ⩾ 3 vertices. Dirac's minimum degree condition is the condition that a...
AbstractWe call a chordless path v1v2…vi simplicial if it does not extend into any chordless path v0...
Unichord-free graphs are defined as having no cycle with a unique chord. They have appeared in sever...
AbstractIn our study of the extremities of a graph, we define a moplex as a maximal clique module th...
Abstract. Consider the following problem, that we call “Chordless Path through Three Vertices ” or C...
AbstractLet X be a subset of the vertex set of a graph G. We denote by κ(X) the smallest number of v...
AbstractConsider the following problem, which we call “Chordless path through three vertices” or CP3...
Let G be a graph on n 3 vertices. Dirac's minimum degree condition is the condition that all vertice...
11 p. : il.A graph G is said to be chordless if no cycle in G has a chord. Chordless graphs are exac...
Gallai conjectured that every connected graph on n vertices admits a path decomposition, i.e., a dec...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractA graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
A graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal (chorda...
The biclique problem asks, given a graph G and a parameter k, whether G has a complete bipartite sub...
AbstractLet G be a graph on n ⩾ 3 vertices. Dirac's minimum degree condition is the condition that a...
AbstractWe call a chordless path v1v2…vi simplicial if it does not extend into any chordless path v0...
Unichord-free graphs are defined as having no cycle with a unique chord. They have appeared in sever...
AbstractIn our study of the extremities of a graph, we define a moplex as a maximal clique module th...
Abstract. Consider the following problem, that we call “Chordless Path through Three Vertices ” or C...
AbstractLet X be a subset of the vertex set of a graph G. We denote by κ(X) the smallest number of v...
AbstractConsider the following problem, which we call “Chordless path through three vertices” or CP3...
Let G be a graph on n 3 vertices. Dirac's minimum degree condition is the condition that all vertice...
11 p. : il.A graph G is said to be chordless if no cycle in G has a chord. Chordless graphs are exac...
Gallai conjectured that every connected graph on n vertices admits a path decomposition, i.e., a dec...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractA graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
A graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal (chorda...
The biclique problem asks, given a graph G and a parameter k, whether G has a complete bipartite sub...
AbstractLet G be a graph on n ⩾ 3 vertices. Dirac's minimum degree condition is the condition that a...
DOI
Add to ORKG