The following pages link to Douglas R. Woodall (Q214988):
Displaying 50 items.
- (Q186120) (redirect page) (← links)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 (Q396738) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Best monotone degree conditions for binding number and cycle structure (Q496429) (← links)
- Ohba's conjecture for graphs with independence number five (Q536225) (← links)
- Bond graphs. I: Acausal equivalence (Q674444) (← links)
- Bond graphs. III: Bond graphs and electrical networks (Q678853) (← links)
- Bond graphs. II: Causality and singularity (Q678882) (← links)
- Total 4-choosability of series-parallel graphs (Q870016) (← links)
- Edge and total choosability of near-outerplanar graphs (Q870017) (← links)
- List-colouring the square of a \(K_4\)-minor-free graph (Q941324) (← links)
- The average degree of a multigraph critical with respect to edge or total choosability (Q966012) (← links)
- Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
- A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs (Q1045198) (← links)
- A note on the cake-division problem (Q1075937) (← links)
- Sets on which several measures agree (Q1088802) (← links)
- How proportional is proportional representation? (Q1089286) (← links)
- Forbidden graphs for degree and neighbourhood conditions (Q1119603) (← links)
- Vector transversals (Q1155624) (← links)
- Dividing a cake fairly (Q1160300) (← links)
- Some notes on Feinberg's k-independence problem (Q1170249) (← links)
- Local and global proportionality (Q1193452) (← links)
- An inequality for chromatic polynomials (Q1197039) (← links)
- A zero-free interval for chromatic polynomials (Q1197040) (← links)
- Cycle lengths and circuit matroids of graphs (Q1199495) (← links)
- A sufficient condition for Hamiltonian circuits (Q1223311) (← links)
- A note on a problem of Halin's (Q1229234) (← links)
- A note on rank functions and integer programming (Q1238816) (← links)
- Circuits containing specified edges (Q1239747) (← links)
- Edge-choosability in line-perfect multigraphs (Q1301714) (← links)
- Edge-choosability of multicircuits (Q1301722) (← links)
- Monotonicity of single-seat preferential election rules (Q1364784) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- The largest real zero of the chromatic polynomial (Q1366787) (← links)
- Total colourings of planar graphs with large girth (Q1378290) (← links)
- Choosability of powers of circuits (Q1396660) (← links)
- Cycle orders (Q1568668) (← links)
- On kernel-perfect orientations of line graphs (Q1584425) (← links)
- Tutte polynomial expansions for 2-separable graphs (Q1598799) (← links)
- Binding number conditions for matching extension (Q1598823) (← links)
- Density conditions for panchromatic colourings of hypergraphs (Q1603255) (← links)
- Cyclic degrees of 3-polytopes (Q1808711) (← links)
- A proof of McKee's Eulerian-bipartite characterization (Q1814018) (← links)
- Transversals in uniform hypergraphs with property (7, 2) (Q1817581) (← links)
- An impossibility theorem for electoral systems (Q1820654) (← links)
- Defective choosability results for outerplanar and related graphs (Q1850061) (← links)
- Triangles and neighbourhoods of independent sets in graphs (Q1850489) (← links)
- An identity involving 3-regular graphs (Q1917501) (← links)
- Weight of faces in plane maps (Q1966247) (← links)
- On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
