2 problems

An edge-ordered graph is a graph whose edges are equipped with a linear ordering. A graph is $d$-degenerate if every induced subgraph has a vertex of degree at most $d$. For an edg…

An edge-ordered graph is a graph whose edges are equipped with a linear ordering. A graph is $d$-degenerate if every induced subgraph has a vertex of degree at most $d$. For an edg…