5 citations · 12 across the 9 of their papers we have counts for
3 papers · 1 filter
Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles
Maria Axenovich, John Goldwasser, Ryan Hansen +5
If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polych…
Cop-Win Graphs: Optimal Strategies and Corner Rank
David Offner, Kerry Ojakian
We investigate the game of cops and robber, played on a finite graph, between one cop and one robber. If the cop can force a win on a graph, the graph is called cop-win. We describ…
Polychromatic Colorings on the Hypercube
John Goldwasser, Bernard Lidický, Ryan R. Martin +3
Given a subgraph G of the hypercube Q_n, a coloring of the edges of Q_n such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The max…