The following pages link to Penny E. Haxell (Q353398):
Displaying 50 items.
- Tree-minimal graphs are almost regular (Q353399) (← links)
- Primality of trees (Q357453) (← links)
- Packing and covering tetrahedra (Q385147) (← links)
- (Q412271) (redirect page) (← links)
- A stability theorem on fractional covering of triangles by edges (Q412272) (← links)
- On Ryser's conjecture (Q426782) (← links)
- (Q591622) (redirect page) (← links)
- A note on Schnyder's theorem (Q634746) (← links)
- Extremal hypergraphs for Ryser's conjecture (Q721059) (← links)
- The Ramsey number for hypergraph cycles. I. (Q817613) (← links)
- Integer and fractional packings in dense graphs (Q873647) (← links)
- Packing and covering triangles in planar graphs (Q968221) (← links)
- On directed triangles in digraphs (Q1010591) (← links)
- Large monochromatic components in colorings of complete 3-uniform hypergraphs (Q1025935) (← links)
- Counting interval orders (Q1098864) (← links)
- Partitioning by monochromatic trees (Q1125948) (← links)
- Packing and covering triangles in graphs (Q1296990) (← links)
- A note on a conjecture of Ryser (Q1346392) (← links)
- Partitioning complete bipartite graphs by monochromatic cycles (Q1354726) (← links)
- Packing and covering triangles in tripartite graphs (Q1385295) (← links)
- Bounded size components -- partitions and transversals. (Q1400964) (← links)
- To Adrian Bondy and U.S.R. Murty. (Q1425104) (← links)
- Embedding trees into graphs of large girth (Q1567289) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- Homological connectedness of random hypergraphs (Q1689925) (← links)
- Morphing Schnyder drawings of planar triangulations (Q1739203) (← links)
- A note on a conjecture of Gallai (Q1805373) (← links)
- Ramsey numbers for trees of small maximum degree (Q1848150) (← links)
- A note on cycle lengths in graphs (Q1865137) (← links)
- Turán's extremal problem in random graphs: Forbidding even cycles (Q1898722) (← links)
- A condition for matchability in hypergraphs (Q1900519) (← links)
- Turán's extremal problem in random graphs: Forbidding odd cycles (Q1912754) (← links)
- Atoms of set systems with a fixed number of pairwise unions (Q1916106) (← links)
- Packing and covering triangles in \(K_{4}\)-free planar graphs (Q1926019) (← links)
- List coloring hypergraphs (Q1960283) (← links)
- Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
- A note on intersecting hypergraphs with large cover number (Q2401407) (← links)
- Edge coloring multigraphs without small dense subsets (Q2515595) (← links)
- Tree embeddings (Q2712588) (← links)
- A Note on Vertex List Colouring (Q2757076) (← links)
- On Even-Degree Subgraphs of Linear Hypergraphs (Q2883855) (← links)
- Bounded transversals in multipartite graphs (Q2897209) (← links)
- Independent transversals and hypergraph matchings - an elementary approach (Q2957181) (← links)
- On the Stable Paths Problem (Q3008033) (← links)
- On Forming Committees (Q3100868) (← links)
- On characterizing Vizing's edge colouring bound (Q3113286) (← links)
- Odd Independent Transversals are Odd (Q3373664) (← links)
- Independent dominating sets and hamiltonian cycles (Q3427374) (← links)
- An improved bound for the strong chromatic number (Q3506316) (← links)
- An Algorithmic Version of the Hypergraph Regularity Method (Q3549322) (← links)
