Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs (Q1675823): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks immune to isolated failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning 2-trees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the locally connected spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221384 / rank
 
Normal rank

Revision as of 15:39, 14 July 2024

scientific article
Language Label Description Also known as
English
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
scientific article

    Statements

    Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs (English)
    0 references
    0 references
    3 November 2017
    0 references
    algorithms
    0 references
    graph algorithms
    0 references
    locally connected spanning tree
    0 references
    NP-completeness
    0 references

    Identifiers