The following pages link to Steven D. Noble (Q412351):
Displaying 49 items.
- Simple dynamics on graphs (Q266275) (← links)
- (Q338569) (redirect page) (← links)
- On zeros of the characteristic polynomial of matroids of bounded tree-width (Q338570) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- On plane graphs with link component number equal to the nullity (Q423970) (← links)
- On the structure of the \(h\)-vector of a paving matroid (Q449206) (← links)
- The clustering coefficient of a scale-free random graph (Q548267) (← links)
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- Some inequalities for the Tutte polynomial (Q627930) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Maximizing edge-ratio is NP-complete (Q765326) (← links)
- Finding next-to-shortest paths in a graph (Q834912) (← links)
- Evaluating a weighted graph polynomial for graphs of bounded tree-width (Q1028845) (← links)
- A weighted graph polynomial from chromatic invariants of knots (Q1296158) (← links)
- Domination analysis of greedy heuristics for the frequency assignment problem. (Q1420614) (← links)
- How many delta-matroids are there? (Q1686257) (← links)
- The structure of delta-matroids with width one twists (Q1691103) (← links)
- The \(e\)-exchange basis graph and matroid connectedness (Q1712515) (← links)
- Improved bounds for the number of forests and acyclic orientations in the square lattice (Q1856350) (← links)
- Cyclic labellings with constraints at two distances (Q1883626) (← links)
- Recognising a partitionable simplicial complex is in \(\text{NP}\) (Q1917504) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- The excluded 3-minors for vf-safe delta-matroids (Q2020023) (← links)
- Delta-matroids as subsystems of sequences of Higgs lifts (Q2020024) (← links)
- Irreducibility of the Tutte polynomial of an embedded graph (Q2109226) (← links)
- Ordering circuits of matroids (Q2112564) (← links)
- Matroids, delta-matroids and embedded graphs (Q2318477) (← links)
- Generalizations of the matching polynomial to the multivariate independence polynomial (Q2328133) (← links)
- The complexity of solution-free sets of integers for general linear equations (Q2334046) (← links)
- Inductive tools for connected delta-matroids and multimatroids (Q2357221) (← links)
- Note on incidence chromatic number of subquartic graphs (Q2410036) (← links)
- The Merino-Welsh conjecture holds for series-parallel graphs (Q2637235) (← links)
- Integer flows and orientations (Q2822596) (← links)
- Minimizing the oriented diameter of a planar graph (Q2851475) (← links)
- The Tutte polynomial characterizes simple outerplanar graphs (Q2857420) (← links)
- (Q3447288) (← links)
- The Equivalence of Two Graph Polynomials and a Symmetric Function (Q3552515) (← links)
- Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width (Q4228207) (← links)
- Knot graphs (Q4487078) (← links)
- (Q5021352) (← links)
- The Tutte Polynomial Characterizes Simple Outerplanar Graphs (Q5199509) (← links)
- Evaluating the Rank Generating Function of a Graphic 2-Polymatroid (Q5479035) (← links)
- On the interplay between embedded graphs and delta-matroids (Q5741948) (← links)
- The U, V, and W polynomials (Q5890010) (← links)
- Optimal arrangement of data in a tree directory (Q5951966) (← links)
- A splitter theorem for elastic elements in 3-connected matroids (Q6042103) (← links)
- A coarse Tutte polynomial for hypermaps (Q6528473) (← links)
- Permutation Tutte polynomial (Q6568865) (← links)
- An activities expansion of the transition polynomial of a multimatroid (Q6739905) (← links)
