Maximum independent sets in 3- and 4-regular Hamiltonian graphs (Q709325): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2010.05.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020320404 / rank
 
Normal rank
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references