Requiring chords in cycles (Q2566156): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac-type characterizations of graphs without long chordless cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint clique cutsets in graphs without long holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the null-homotopy of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank

Latest revision as of 15:36, 10 June 2024

scientific article
Language Label Description Also known as
English
Requiring chords in cycles
scientific article

    Statements

    Requiring chords in cycles (English)
    0 references
    0 references
    22 September 2005
    0 references
    Chordal graph
    0 references
    Chordal bipartite graph
    0 references
    Distance-hereditary graph
    0 references
    Strongly chordal graph
    0 references

    Identifiers