The following pages link to Bruce A. Reed (Q661944):
Displaying 50 items.
- (Q199394) (redirect page) (← links)
- (Q1088679) (redirect page) (← links)
- Removable paths and cycles with parity constraints (Q402593) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- List colouring when the chromatic number is close to the order of the graph (Q558319) (← links)
- A note on short cycles in digraphs (Q580357) (← links)
- The edge-density for \(K_{2,t}\) minors (Q618032) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- How to determine if a random graph with a fixed degree sequence has a giant component (Q681521) (← links)
- Polychromatic Hamilton cycles (Q685588) (← links)
- Finding odd cycle transversals. (Q703225) (← links)
- Tight bounds on the clique chromatic number (Q820840) (← links)
- Faster mixing and small bottlenecks (Q863483) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- (Q947110) (redirect page) (← links)
- Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
- A weaker version of Lovász' path removal conjecture (Q947724) (← links)
- Bisimplicial vertices in even-hole-free graphs (Q958679) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Corrigendum to ``Asymptotically optimal frugal colouring'' [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)] (Q965251) (← links)
- Tree-width of graphs without a \(3\times 3\) grid minor (Q967302) (← links)
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337) (← links)
- Highly parity linked graphs (Q987554) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- A semi-strong perfect graph theorem (Q1104341) (← links)
- Edge-colouring random graphs (Q1109790) (← links)
- \(P_ 4\)-comparability graphs (Q1121924) (← links)
- Mangoes and blueberries (Q1125684) (← links)
- Star arboricity (Q1204531) (← links)
- Colouring a graph frugally (Q1280272) (← links)
- Edge-disjoint odd cycles in graphs with small chromatic numbers (Q1296141) (← links)
- Colouring proximity graphs in the plane (Q1297436) (← links)
- A bound on the total chromatic number (Q1297726) (← links)
- Critical subgraphs of a random graph (Q1305173) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- Edge coloring nearly bipartite graphs (Q1306362) (← links)
- A description of claw-free perfect graphs (Q1306428) (← links)
- Fractionally colouring total graphs (Q1316649) (← links)
- Complete multi-partite cutsets in minimal imperfect graphs (Q1322031) (← links)
- Rooted routing in the plane (Q1346696) (← links)
- A bound on the strong chromatic index of a graph (Q1354718) (← links)
- Path parity and perfection (Q1356748) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- On planar perfectly contractile graphs (Q1359374) (← links)
- The Gallai-Younger conjecture for planar graphs (Q1375627) (← links)
- Packing directed circuits (Q1375699) (← links)
- A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\) (Q1417575) (← links)
- Channel assignment on graphs of bounded treewidth (Q1417576) (← links)
