Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs
Sign Up to like & getrecommendations! Published in 2018 at "Combinatorica"
DOI: 10.1007/s00493-017-3593-0
Abstract: It is well-known that the graphs not containing a given graph H as a subgraph have bounded chromatic number if and only if H is acyclic. Here we consider ordered graphs, i.e., graphs with a… read more here.
Keywords: left right; graphs; number ordered; ordered graphs ... See more keywords