Ore-type degree conditions for disjoint path covers in simple graphs (Q898138): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2015.10.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162674041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-fixed-endpoint path cover problem is Polynomial on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers of the hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-equal-disjoint path cover problem of matching composition network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Path Cover Problems in Digraphs and Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-source three-disjoint path covers in cubes of connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint path covers in cubes of connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes / rank
 
Normal rank

Latest revision as of 04:52, 11 July 2024

scientific article
Language Label Description Also known as
English
Ore-type degree conditions for disjoint path covers in simple graphs
scientific article

    Statements

    Ore-type degree conditions for disjoint path covers in simple graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    Ore's theorem
    0 references
    degree condition
    0 references
    disjoint path cover
    0 references
    path partition
    0 references
    Hamiltonian-connected graph
    0 references
    0 references