Conditions for graphs to be path partition optimal (Q1709536): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Created claim: Wikidata QID (P12): Q130194299, #quickstatements; #temporary_batch_1729946815562
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bin Long Li / rank
 
Normal rank
Property / author
 
Property / author: Hajo J. Broersma / rank
 
Normal rank
Property / author
 
Property / author: Sheng Gui Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2018.02.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793133492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on two sufficient conditions for Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions on induced claws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing forbidden pairs for hamiltonian properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy subgraph pairs for traceability of block-chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130194299 / rank
 
Normal rank

Latest revision as of 14:02, 26 October 2024

scientific article
Language Label Description Also known as
English
Conditions for graphs to be path partition optimal
scientific article

    Statements

    Conditions for graphs to be path partition optimal (English)
    0 references
    5 April 2018
    0 references
    path partition number
    0 references
    separable degree
    0 references
    path partition optimal
    0 references
    forbidden subgraph
    0 references
    heavy subgraph
    0 references
    heft index
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references