The following pages link to Graph Theory (Q2829286):
Displaying 50 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Algebraically grid-like graphs have large tree-width (Q668066) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Cliques in hyperbolic random graphs (Q724237) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Vague multigraphs (Q780184) (← links)
- Edge-distinguishing of star-free graphs (Q785585) (← links)
- A note on the Gaffney Laplacian on infinite metric graphs (Q820511) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- Consequences of the packing problem (Q825535) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Consensus and voting on large graphs: an application of graph limit theory (Q1661028) (← links)
- Extremum seeking based fault-tolerant cooperative control for multiagent systems (Q1666562) (← links)
- Monochromatic trees in random graphs (Q1690004) (← links)
- On contact graphs of paths on a grid (Q1725765) (← links)
- Metric currents and the Poincaré inequality (Q1732796) (← links)
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- Rooted complete minors in line graphs with a Kempe coloring (Q1741595) (← links)
- The geometry of partial fitness orders and an efficient method for detecting genetic interactions (Q1784416) (← links)
- Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
- A lower bound on the zero forcing number (Q1801082) (← links)
- Seminormality, canonical modules, and regularity of cut polytopes (Q1979324) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Existence of a spanning tree having small diameter (Q1981668) (← links)
- Enlarging vertex-flames in countable digraphs (Q1984520) (← links)
- Long cycles, heavy cycles and cycle decompositions in digraphs (Q1998760) (← links)
- Proximity semantics for topic-based abstract argumentation (Q1999092) (← links)
- Planarity of Cayley graphs of graph products of groups (Q1999748) (← links)
- Higher cyclic operads (Q2000783) (← links)
- The Dirichlet problem for orthodiagonal maps (Q2006082) (← links)
- Connectivity of cubical polytopes (Q2010623) (← links)
- Vertex-facet assignments for polytopes (Q2022354) (← links)
- Bottleneck subset-type restricted matching problems (Q2023130) (← links)
- Tilings from graph directed iterated function systems (Q2025660) (← links)
- A characterization of trees based on edge-deletion and its applications for domination-type invariants (Q2028069) (← links)
- Theoretical aspects of equitable partition of networks into sparse modules (Q2031046) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- A new proof of Balinski's theorem on the connectivity of polytopes (Q2032731) (← links)
- Improved bounds on the Ramsey number of fans (Q2033888) (← links)
- Fractal dimension and lower bounds for geometric problems (Q2039303) (← links)
- Unavoidable minors for graphs with large \(\ell_p\)-dimension (Q2039320) (← links)
- Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Simplicity of augmentation submodules for transformation monoids (Q2042297) (← links)
- Distribution of contractible edges and the structure of noncontractible edges having endvertices with large degree in a 4-connected graph (Q2042615) (← links)
- Achromatic number and facial achromatic number of connected locally-connected graphs (Q2043353) (← links)
- Induced nets and Hamiltonicity of claw-free graphs (Q2045363) (← links)
- The linkedness of cubical polytopes: the cube (Q2049620) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
