AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other words, the graph is chordal—if and only if every k-cycle is the sum of k-2 triangles. This result generalizes to having or not having crossing chords and to having strong chords, with similar characterizations of a variety of graph classes that includes chordal bipartite, distance-hereditary, and strongly chordal graphs
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
AbstractRobert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the sy...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
AbstractRobert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the sy...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it...
An i-chord of a cycle or path is an edge whose endpoints are a distance i ≥ 2 apart along the cycle ...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
AbstractA graph is chordal if every cycle of length strictly greater than three has a chord. A neces...
AbstractThe ‘strength’ of an edge or cycle is the number of maximal complete subgraphs it is in. Str...
A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a large...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
AbstractRobert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the sy...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
AbstractRobert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the sy...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it...
An i-chord of a cycle or path is an edge whose endpoints are a distance i ≥ 2 apart along the cycle ...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
AbstractA graph is chordal if every cycle of length strictly greater than three has a chord. A neces...
AbstractThe ‘strength’ of an edge or cycle is the number of maximal complete subgraphs it is in. Str...
A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a large...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length...
DOI
Add to ORKG