Facial Nonrepetitive Vertex Coloring of Plane Graphs (Q2852615): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3123004055 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1105.1023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs / 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: Nonrepetitive colouring via entropy compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive vertex colorings of graphs / 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: A new bound on the cyclic chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths, planarizing cycles, and spanning walks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:12, 6 July 2024

scientific article
Language Label Description Also known as
English
Facial Nonrepetitive Vertex Coloring of Plane Graphs
scientific article

    Statements