Some results in square-free and strong square-free edge-colorings of graphs (Q879399): 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.2006.09.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976019259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Problems in Pattern Avoidance / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of the Morse Minimal Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square-free and cube-free colorings of the ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative properties of the Thue-Morse sequence / rank
 
Normal rank

Latest revision as of 18:57, 25 June 2024

scientific article
Language Label Description Also known as
English
Some results in square-free and strong square-free edge-colorings of graphs
scientific article

    Statements