The following pages link to R. E. L. Aldred (Q189706):
Displaying 50 items.
- Distance matching in punctured planar triangulations (Q286771) (← links)
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- Proximity thresholds for matching extension in the torus and Klein bottle (Q423899) (← links)
- Matching extension in prism graphs (Q512532) (← links)
- Cycles through five edges in 3-connected cubic graphs (Q581414) (← links)
- (Q587977) (redirect page) (← links)
- Cycles through specified vertices (Q684399) (← links)
- Partition of a bipartite graph into cycles (Q686183) (← links)
- Covering the complete graph with plane cycles (Q686275) (← links)
- A characterization of intersection graphs of the maximal rectangles of a polyomino (Q687125) (← links)
- Graphs and digraphs with all 2-factors isomorphic (Q705894) (← links)
- The structure of \(4-\gamma \)-critical graphs with a cut vertex (Q708397) (← links)
- Distance-restricted matching extension in planar triangulations (Q709306) (← links)
- Distance-restricted matching extension in triangulations of the torus and the Klein bottle (Q743652) (← links)
- Cycles through four edges in 3-connected cubic graphs (Q753835) (← links)
- Restricted matching in plane triangulations and near triangulations (Q777390) (← links)
- Sparsest cuts and bottlenecks in graphs (Q810053) (← links)
- The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems (Q810055) (← links)
- Permuting machines and priority queues (Q817805) (← links)
- \(k\)-factors in regular graphs and edge-connectivity (Q950664) (← links)
- Avoiding consecutive patterns in permutations (Q990772) (← links)
- Restricted matching in graphs of small genus (Q998321) (← links)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (Q1003683) (← links)
- Partitioning regular graphs into equicardinal linear forests (Q1174174) (← links)
- On a generalization of a theorem of Nash-Williams (Q1179465) (← links)
- Uniform cyclic edge connectivity in cubic graphs (Q1180413) (← links)
- Contractible edges in non-separating cycles (Q1181016) (← links)
- A class of self-orthogonal 2-sequencings (Q1182413) (← links)
- Cycles in random graphs (Q1185100) (← links)
- Gallai-Milgram properties for infinite graphs (Q1191912) (← links)
- Generalized degrees and Menger path systems (Q1199423) (← links)
- Distribution of contractible edges in k-connected graphs (Q1262876) (← links)
- On matching extensions with prescribed and proscribed edge sets. II (Q1292810) (← links)
- Two results on matching extensions with prescribed and proscribed edge sets (Q1304803) (← links)
- On `maximal' Hamiltonian cycles in the square of a block (Q1309471) (← links)
- Shortest circuit covers of cubic graphs (Q1322025) (← links)
- Cycles in graphs with prescribed stability number and connectivity (Q1322027) (← links)
- A degree characterisation of pancyclicity (Q1322211) (← links)
- Contractible edges in longest cycles in non-Hamiltonian graphs (Q1336689) (← links)
- On the density of sets of divisors (Q1343798) (← links)
- The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint (Q1346794) (← links)
- Algebraic characterizations of distance-regular graphs (Q1348144) (← links)
- Frames of cycles and directed cycles (Q1366909) (← links)
- On the number of cycles in 3-connected cubic graphs (Q1386478) (← links)
- \(M\)-alternating paths in \(n\)-extendable bipartite graphs (Q1402062) (← links)
- On the characterization of the folded halved cubes by their intersection arrays (Q1404329) (← links)
- Vertex-disjoint cycles of the same length. (Q1405099) (← links)
- Orthogonal representations and connectivity of graphs (Q1823259) (← links)
- A note on the number of graceful labellings of paths (Q1861279) (← links)
- Graphs with not all possible path-kernels (Q1877673) (← links)
