Forbidden pairs of disconnected graphs for traceability in connected graphs (Q2359961): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure and stable Hamiltonian properties in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing forbidden pairs for hamiltonian properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank

Latest revision as of 00:16, 14 July 2024

scientific article
Language Label Description Also known as
English
Forbidden pairs of disconnected graphs for traceability in connected graphs
scientific article

    Statements

    Forbidden pairs of disconnected graphs for traceability in connected graphs (English)
    0 references
    23 June 2017
    0 references
    forbidden subgraph
    0 references
    traceability
    0 references
    disconnected graph
    0 references
    0 references
    0 references
    0 references

    Identifiers