Hamilton-chain saturated hypergraphs (Q966015): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q276192
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Andrzej Żak / 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.2009.11.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146801905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on the Hamiltonian Theme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest maximally nonhamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest maximally nonhamiltonian graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian path saturated graphs with small size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal \(k\)-edge-Hamiltonian hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound for the size of maximal nontraceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian chains in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc coverings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs maximal with respect to absence of hamiltonian paths / rank
 
Normal rank

Latest revision as of 19:18, 2 July 2024

scientific article
Language Label Description Also known as
English
Hamilton-chain saturated hypergraphs
scientific article

    Statements

    Hamilton-chain saturated hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2010
    0 references
    graph
    0 references
    saturated graph
    0 references
    hypergraph
    0 references
    Hamiltonian path
    0 references
    Hamiltonian cycle
    0 references
    Hamiltonian chain
    0 references

    Identifiers