The following pages link to Douglas B. West (Q185079):
Displaying 50 items.
- Fractional and circular separation dimension of graphs (Q1686246) (← links)
- Decomposition of regular hypergraphs (Q1691212) (← links)
- Online sum-paintability: the slow-coloring game (Q1699554) (← links)
- The unit acquisition number of a graph (Q1732112) (← links)
- Extremal problems on saturation for the family of $k$-edge-connected graphs (Q1741522) (← links)
- Randomly twisted hypercubes (Q1746591) (← links)
- Gray code enumeration of families of integer partitions (Q1805052) (← links)
- Acyclic orientations of complete bipartite graphs (Q1842186) (← links)
- On restricted edge-colorings of bicliques (Q1850030) (← links)
- On the existence of Hamiltonian paths in the cover graph of \(M\)(\(n\)) (Q1868855) (← links)
- Interval number of special posets and random posets (Q1898344) (← links)
- Representing digraphs using intervals or circular arcs (Q1910520) (← links)
- Large \(2P_ 3\)-free graphs with bounded degree (Q1916098) (← links)
- Uniquely \(C _{4}\)-saturated graphs (Q1926058) (← links)
- Revolutionaries and spies: spy-good and spy-bad graphs (Q1929215) (← links)
- Locating a robber on a graph via distance queries (Q1929218) (← links)
- Revolutionaries and spies on trees and unicyclic graphs (Q1937355) (← links)
- A note on generalized chromatic number and generalized girth (Q1970697) (← links)
- Perfection thickness of graphs (Q1974539) (← links)
- Largest 2-regular subgraphs in 3-regular graphs (Q2000571) (← links)
- The slow-coloring game on sparse graphs: \(k\)-degenerate, planar, and outerplanar (Q2041698) (← links)
- Systems of overlap representation for families of intervals (Q2115149) (← links)
- Cycles in color-critical graphs (Q2121717) (← links)
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784) (← links)
- Lichiardopol's conjecture on disjoint cycles in tournaments (Q2188844) (← links)
- Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs (Q2192084) (← links)
- 3-regular graphs are 2-reconstructible (Q2225421) (← links)
- On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness (Q2225445) (← links)
- Ramsey numbers of interval 2-chromatic ordered graphs (Q2334071) (← links)
- Sharp lower bounds on the fractional matching number (Q2345617) (← links)
- On \(r\)-dynamic coloring of grids (Q2345621) (← links)
- Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs (Q2352793) (← links)
- Bar visibility numbers for hypercubes and outerplanar digraphs (Q2361088) (← links)
- Clique coverings of the edges of a random graph (Q2367438) (← links)
- Chain-making games in grid-like posets (Q2375851) (← links)
- Chromatic number for a generalization of Cartesian product graphs (Q2380225) (← links)
- Editorial Announcement: Hello, World (Q2384413) (← links)
- Improved bounds on families under \(k\)-wise set-intersection constraints (Q2385138) (← links)
- Hypergraph extension of the Alon-Tarsi list coloring theorem (Q2387187) (← links)
- The vulnerability of the diameter of the enhanced hypercubes (Q2404080) (← links)
- Online sum-paintability: slow-coloring of trees (Q2416431) (← links)
- Acquisition-extremal graphs (Q2446335) (← links)
- Game matching number of graphs (Q2446826) (← links)
- Three topics in online list coloring (Q2448254) (← links)
- Decomposition of Cartesian products of regular graphs into isomorphic trees (Q2449976) (← links)
- Circular \((5,2)\)-coloring of sparse graphs (Q2454506) (← links)
- Short proofs for cut-and-paste sorting of permutations (Q2461214) (← links)
- Research problems from the 20th British Combinatorial Conference (Q2470428) (← links)
- Extending precolorings to circular colorings (Q2496199) (← links)
- Tetrahedrizing point sets in three dimensions (Q2638826) (← links)
