The following pages link to Douglas B. West (Q185079):
Displaying 50 items.
- Extremal problems for degree-based topological indices (Q260046) (← links)
- To catch a falling robber (Q265090) (← links)
- On \(r\)-dynamic coloring of graphs (Q277619) (← links)
- Rainbow spanning subgraphs of small diameter in edge-colored complete graphs (Q292270) (← links)
- Cubic graphs with large ratio of independent domination number to domination number (Q295260) (← links)
- Coloring, sparseness and girth (Q312271) (← links)
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- Multicolor on-line degree Ramsey numbers of trees (Q353401) (← links)
- Bounds on the \(k\)-dimension of products of special posets (Q382878) (← links)
- Rainbow edge-coloring and rainbow domination (Q383777) (← links)
- Extensions to 2-factors in bipartite graphs (Q396808) (← links)
- Cutwidth of triangular grids (Q397153) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Equicovering subgraphs of graphs and hypergraphs (Q405168) (← links)
- Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps (Q411650) (← links)
- Cycle spectra of Hamiltonian graphs (Q444376) (← links)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Linear discrepancy of chain products and posets with bounded degree (Q466867) (← links)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
- The adversary degree-associated reconstruction number of double-brooms (Q491632) (← links)
- Sum-paintability of generalized theta-graphs (Q497323) (← links)
- Circular chromatic Ramsey number (Q501991) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Degree-associated reconstruction parameters of complete multipartite graphs and their complements (Q514928) (← links)
- Equitable hypergraph orientations (Q540133) (← links)
- Acyclic sets in \(k\)-majority tournaments (Q547779) (← links)
- On-line Ramsey theory for bounded degree graphs (Q551227) (← links)
- Two easy duality theorems for product partial orders (Q580378) (← links)
- The edge-count criterion for graphic lists (Q612910) (← links)
- Matching and edge-connectivity in regular graphs (Q616391) (← links)
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem (Q641542) (← links)
- Longest cycles in \(k\)-connected graphs with given independence number (Q651036) (← links)
- Connected domination number of a graph and its complement (Q659759) (← links)
- The total interval number of a graph. I: Fundamental classes (Q685584) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- Degree Ramsey numbers for cycles and blowups of trees (Q691593) (← links)
- On pattern Ramsey numbers of graphs (Q704832) (← links)
- Degree-associated reconstruction number of graphs (Q709303) (← links)
- Forbidden subposets for fractional weak discrepancy at most \(k\) (Q710717) (← links)
- A new proof that 4-connected planar graphs are Hamiltonian-connected (Q726634) (← links)
- Recognizing graphs with fixed interval number is NP-complete (Q760213) (← links)
- Packing of Steiner trees and \(S\)-connectors in graphs (Q765198) (← links)
- The interval number of a planar graph: Three intervals suffice (Q786830) (← links)
- Some remarks on normalized matching (Q787981) (← links)
- A class of solutions to the gossip problem. III (Q791539) (← links)
- The interval number of a complete multipartite graph (Q792347) (← links)
- Regressions and monotone chains: A Ramsey-type extremal problem for partial orders (Q794668) (← links)
- Wide posets with fixed height and cutset number (Q807651) (← links)
- Research problems from the 5th Slovenian Conference (Bled, 2003) (Q864155) (← links)
- Ordered Ramsey theory and track representations of graphs (Q890582) (← links)
