Nonrepetitive vertex colorings of graphs (Q658062): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On square-free vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of trees / 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: The structure of 1-planar 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: Facial non-repetitive edge-coloring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs drawn with few crossings per edge / rank
 
Normal rank

Latest revision as of 20:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Nonrepetitive vertex colorings of graphs
scientific article

    Statements

    Identifiers