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
AbstractA well-known result of Dirac (Math. Nachr. 22 (1960) 61) says that given n vertices in an n-...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
A graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal (chorda...
AbstractWe call a chordless path v1v2…vi simplicial if it does not extend into any chordless path v0...
AbstractConsider the following problem, which we call “Chordless path through three vertices” or CP3...
AbstractA graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal...
AbstractWe investigate the class of graphs defined by the property that every induced subgraph has a...
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...
AbstractIn this paper, we prove that if every vertex of a simple graph has degree at least δ, then i...
AbstractA graph is triangulated if it has no chordless cycle with four or more vertices. It follows ...
AbstractIn this paper, we give a generalization of a well-known result of Dirac that given any k ver...
AbstractIt is shown that the maximal length c of a circuit in a graph satisfies c≧2ϱ0+1, ϱ0=minaϱ(a)...
We give a structural description of the class 𝒞 of graphs that do not contain a cycle with a un...
AbstractA well-known result of Dirac (Math. Nachr. 22 (1960) 61) says that given n vertices in an n-...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
A graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal (chorda...
AbstractWe call a chordless path v1v2…vi simplicial if it does not extend into any chordless path v0...
AbstractConsider the following problem, which we call “Chordless path through three vertices” or CP3...
AbstractA graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal...
AbstractWe investigate the class of graphs defined by the property that every induced subgraph has a...
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...
AbstractIn this paper, we prove that if every vertex of a simple graph has degree at least δ, then i...
AbstractA graph is triangulated if it has no chordless cycle with four or more vertices. It follows ...
AbstractIn this paper, we give a generalization of a well-known result of Dirac that given any k ver...
AbstractIt is shown that the maximal length c of a circuit in a graph satisfies c≧2ϱ0+1, ϱ0=minaϱ(a)...
We give a structural description of the class 𝒞 of graphs that do not contain a cycle with a un...
AbstractA well-known result of Dirac (Math. Nachr. 22 (1960) 61) says that given n vertices in an n-...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
A graph H has the property MT, if for all graphs G, G is H-free if and only if every minimal (chorda...
DOI
Add to ORKG