The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs (Q3599870): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 04:44, 5 February 2024

scientific article
Language Label Description Also known as
English
The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs
scientific article

    Statements

    The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs (English)
    0 references
    0 references
    9 February 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connected graphs
    0 references
    hamiltonian-connected subgraphs
    0 references
    hamiltonian colorings
    0 references
    hamiltonian chromatic number
    0 references