Maximum independent sets in 3- and 4-regular Hamiltonian graphs (Q709325): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: 3-colorability of 4-regular hamiltonian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A solution to a colouring problem of P. Erdős / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parameterized algorithms in smooth 4-regular Hamiltonian graphs / rank | |||
Normal rank | |||
Revision as of 08:00, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum independent sets in 3- and 4-regular Hamiltonian graphs |
scientific article |
Statements
Maximum independent sets in 3- and 4-regular Hamiltonian graphs (English)
0 references
18 October 2010
0 references
NP-completeness
0 references
maximum independent set
0 references
3- or 4-regular graph
0 references
planar graphs
0 references
