On the facial Thue choice index of plane graphs (Q418875): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4343008 / 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: Nonrepetitive colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lopsided Lovász Local lemma and Latin transversals / 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: Nonrepetitive list colourings of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facial non-repetitive edge-coloring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs / rank
 
Normal rank

Latest revision as of 07:25, 5 July 2024

scientific article
Language Label Description Also known as
English
On the facial Thue choice index of plane graphs
scientific article

    Statements