Injective colorings with arithmetic constraints (Q897262): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060730025 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114229667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triples in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved construction of progression-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large 3-free sets. I. The small \(n\) case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the injective chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Sets Containing No Arithmetic Progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Injective Colourings of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for L(2,1)-Labeling of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5809257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer sets containing no arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Latest revision as of 05:49, 11 July 2024

scientific article
Language Label Description Also known as
English
Injective colorings with arithmetic constraints
scientific article

    Statements

    Injective colorings with arithmetic constraints (English)
    0 references
    17 December 2015
    0 references
    injective colorings
    0 references
    dynamic programming
    0 references
    NP-completeness
    0 references
    polynomial time algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers