On powers and centers of chordal graphs (Q1055453): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3041243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose squares are chordal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the center and diameter of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centers of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank

Latest revision as of 10:19, 14 June 2024

scientific article
Language Label Description Also known as
English
On powers and centers of chordal graphs
scientific article

    Statements

    On powers and centers of chordal graphs (English)
    0 references
    1983
    0 references
    chordal graph
    0 references
    radius
    0 references
    diameter
    0 references
    0 references
    0 references

    Identifiers