On finding constrained independent sets in cycles (Q6130317): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4388342528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Representation by Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for identifying cycle-plus-triangles graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drei Sätze über die n-dimensionale euklidische Sphäre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian property of consecutive-\(d\) digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / 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: Q5689006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding fair independent sets in cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivariant Cohomology and Lower Bounds for Chromatic Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a small agreeable set of indivisible items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological lower bounds for the chromatic number: a hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTING FAMILIES OF SEPARATED SETS / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:02, 29 August 2024

scientific article; zbMATH DE number 7826810
Language Label Description Also known as
English
On finding constrained independent sets in cycles
scientific article; zbMATH DE number 7826810

    Statements

    On finding constrained independent sets in cycles (English)
    0 references
    0 references
    0 references
    2 April 2024
    0 references
    Schrijver graph
    0 references
    Kneser graph
    0 references
    stable sets
    0 references
    PPA-completeness
    0 references

    Identifiers