Anagram-Free Colourings of Graphs (Q3177364): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of perfect matchings in graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting necklaces and measurable colorings of the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial mathematics VIII. Proceedings of the Eighth Australian Conference on Combinatorial Mathematics held at Deakin University, Geelong, Australia, August 25-29, 1980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly non-repetitive sequences and progression-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence and chromatic numbers of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue type problems for graphs, points, and numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian squares are avoidable on 4 letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity thresholds in Achlioptas processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: INFINITE PERIODIC GROUPS. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646912 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s096354831700027x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2743768096 / rank
 
Normal rank

Latest revision as of 10:42, 30 July 2024

scientific article
Language Label Description Also known as
English
Anagram-Free Colourings of Graphs
scientific article

    Statements

    Anagram-Free Colourings of Graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2018
    0 references
    anagram-chromatic number
    0 references

    Identifiers