The following pages link to Chris Jagger (Q1297762):
Displayed 40 items.
- Item:Q1297762 (redirect page) (← links)
- On weakly diamond-free Berge graphs (Q1126205) (← links)
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs (Q1126293) (← links)
- On-line coloring \(k\)-colorable graphs (Q1264277) (← links)
- Circular chromatic numbers and fractional chromatic numbers of distance graphs (Q1266350) (← links)
- Upper bounds on the size of obstructions and intertwines (Q1272647) (← links)
- Extremal digraph results for topological complete subgraphs (Q1272769) (← links)
- Recovering symbolically dated, rooted trees from symbolic ultrametrics (Q1272801) (← links)
- On the Ramsey problem for multicolor bipartite graphs (Q1277209) (← links)
- Regressive Ramsey numbers are Ackermannian (Q1284479) (← links)
- Finding large \(p\)-colored diameter two subgraphs (Q1288513) (← links)
- The Shannon capacity of a union (Q1297763) (← links)
- Subgraph counting identities and Ramsey numbers (Q1354725) (← links)
- Gallai-type theorems and domination parameters (Q1356464) (← links)
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs (Q1356465) (← links)
- Generalized exponents of primitive symmetric digraphs (Q1356508) (← links)
- Double total domination of graphs (Q1356756) (← links)
- Ordered and canonical Ramsey numbers of stars (Q1359377) (← links)
- Aztec diamonds, checkerboard graphs, and spanning trees (Q1361460) (← links)
- On the two largest eigenvalues of trees (Q1361770) (← links)
- Fractional and integral colourings (Q1363414) (← links)
- On the cost-chromatic number of graphs (Q1363702) (← links)
- The four-colour theorem (Q1369648) (← links)
- Tutte's edge-colouring conjecture (Q1369658) (← links)
- Two chromatic polynomial conjectures (Q1369659) (← links)
- Spanning star trees in regular graphs (Q1376073) (← links)
- Tournaments as strong subcontractions (Q1377688) (← links)
- On some conjectures of Graffiti (Q1377723) (← links)
- Distance-regular graphs, MH-colourings and MLD-colourings (Q1377805) (← links)
- The color cost of a caterpillar (Q1377806) (← links)
- On the orientable genus of graphs with bounded nonorientable genus (Q1379843) (← links)
- Non-revisiting paths on surfaces with low genus (Q1379985) (← links)
- The maximum number of edges in a graph with fixed edge-degree (Q1382818) (← links)
- On the structure of digraphs with order close to the Moore bound (Q1393025) (← links)
- Multiplicities of subgraphs (Q1912755) (← links)
- Turán-Ramsey problems (Q1923521) (← links)
- Minimal imperfect graphs: A simple approach (Q1924490) (← links)
- List edge colourings of some 1-factorable multigraphs (Q2563511) (← links)
- Distant Vertex Partitions of Graphs (Q4238171) (← links)
- An extremal function for digraph subcontraction (Q4875690) (← links)