On the geodetic iteration number of distance-hereditary graphs (Q898096): 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: The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of the hull number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex sets in graphs. II: Minimal path convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of ptolemaic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pre-hull number and lexicographic product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141898 / rank
 
Normal rank

Latest revision as of 04:51, 11 July 2024

scientific article
Language Label Description Also known as
English
On the geodetic iteration number of distance-hereditary graphs
scientific article

    Statements

    On the geodetic iteration number of distance-hereditary graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    convex hull
    0 references
    distance-hereditary graph
    0 references
    geodetic iteration number
    0 references

    Identifiers