The following pages link to Journal of Graph Theory
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Hereditary property (links | edit)
- New digraph reconstruction conjecture (links | edit)
- JGT (links | edit)
- Median graph (links | edit)
- Clique-sum (links | edit)
- Even-hole-free graph (links | edit)
- Crossing number (graph theory) (links | edit)
- Hypohamiltonian graph (links | edit)
- Planar separator theorem (links | edit)
- Ladder graph (links | edit)
- Table of the largest known graphs of a given diameter and maximal degree (links | edit)
- Maria Chudnovsky (links | edit)
- Steinitz's theorem (links | edit)
- Star coloring (links | edit)
- Greedy coloring (links | edit)
- Bipartite double cover (links | edit)
- András Hajnal (links | edit)
- Turán's brick factory problem (links | edit)
- Chvátal graph (links | edit)
- Heiko Harborth (links | edit)
- John Adrian Bondy (links | edit)
- McGee graph (links | edit)
- Generalized Petersen graph (links | edit)
- LCF notation (links | edit)
- Half-transitive graph (links | edit)
- Holt graph (links | edit)
- Cycle basis (links | edit)
- Michael Saks (mathematician) (links | edit)
- Stefan Burr (links | edit)
- Robert Frucht (links | edit)
- Brownian excursion (links | edit)
- Caterpillar tree (links | edit)
- Defective coloring (links | edit)
- Pancyclic graph (links | edit)
- Jon Folkman (links | edit)
- Perrin number (links | edit)
- Goldberg–Seymour conjecture (links | edit)
- Intersection number (graph theory) (links | edit)
- Well-covered graph (links | edit)
- Derek Corneil (links | edit)
- Gallai–Hasse–Roy–Vitaver theorem (links | edit)
- Topological graph (links | edit)
- Joan Hutchinson (links | edit)
- Planar cover (links | edit)
- Laves graph (links | edit)
- Iván Gutman (links | edit)
- Wiener–Araya graph (links | edit)
- Distinguishing coloring (links | edit)
- Meringer graph (links | edit)
- Foster cage (links | edit)