The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs (Q3599870): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2147477263 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4350166 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Hamiltonian colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4430837 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4828798 / rank | |||
Normal rank |
Latest revision as of 01:49, 29 June 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
9 February 2009
0 references
connected graphs
0 references
hamiltonian-connected subgraphs
0 references
hamiltonian colorings
0 references
hamiltonian chromatic number
0 references