Person:412351

Available identifiers

zbMath Open noble.steven-dMaRDI QIDQ412351

List of research outcomes

Publication	Date of Publication	Type
The complexity of the greedoid Tutte polynomial	2023-09-08	Paper
Tensor products of multimatroids and a Brylawski-type formula for the transition polynomial	2023-09-01	Paper
The critical group of a combinatorial map	2023-08-25	Paper
The U, V, and W polynomials	2023-04-28	Paper
Irreducibility of the Tutte polynomial of an embedded graph	2022-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q5021352	2022-01-12	Paper
The excluded 3-minors for vf-safe delta-matroids	2021-04-23	Paper
Delta-matroids as subsystems of sequences of Higgs lifts	2021-04-23	Paper
The complexity of solution-free sets of integers for general linear equations	2019-11-06	Paper
Matroids, delta-matroids and embedded graphs	2019-08-15	Paper
On the interplay between embedded graphs and delta-matroids	2019-05-16	Paper
The \(e\)-exchange basis graph and matroid connectedness	2019-01-22	Paper
The structure of delta-matroids with width one twists	2018-01-15	Paper
On the complexity of generalized chromatic polynomials	2018-01-11	Paper
How many delta-matroids are there?	2017-12-21	Paper
Inductive tools for connected delta-matroids and multimatroids	2017-06-19	Paper
On zeros of the characteristic polynomial of matroids of bounded tree-width	2016-11-07	Paper
The Merino-Welsh conjecture holds for series-parallel graphs	2014-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q2857420	2013-11-01	Paper
Minimizing the Oriented Diameter of a Planar Graph	2013-10-10	Paper
On the structure of the \(h\)-vector of a paving matroid	2012-09-12	Paper
On plane graphs with link component number equal to the nullity	2012-05-30	Paper
The complexity of two graph orientation problems	2012-05-04	Paper
Maximizing edge-ratio is NP-complete	2012-03-19	Paper
The Tutte Polynomial Characterizes Simple Outerplanar Graphs	2011-08-16	Paper
The clustering coefficient of a scale-free random graph	2011-06-28	Paper
Some inequalities for the Tutte polynomial	2011-03-04	Paper
\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)	2010-11-05	Paper
The Equivalence of Two Graph Polynomials and a Symmetric Function	2010-04-22	Paper
Finding next-to-shortest paths in a graph	2009-08-27	Paper
Evaluating a weighted graph polynomial for graphs of bounded tree-width	2009-07-08	Paper
Counting cocircuits and convex two-colourings is #P-complete	2008-10-11	Paper
https://portal.mardi4nfdi.de/entity/Q3447288	2007-06-28	Paper
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid	2006-07-06	Paper
Cyclic labellings with constraints at two distances	2004-10-13	Paper
Domination analysis of greedy heuristics for the frequency assignment problem.	2004-02-02	Paper
Improved bounds for the number of forests and acyclic orientations in the square lattice	2003-05-13	Paper
Optimal arrangement of data in a tree directory	2001-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4487078	2000-10-18	Paper
A weighted graph polynomial from chromatic invariants of knots	1999-07-12	Paper
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width	1999-02-02	Paper
Recognising a partitionable simplicial complex is in \(\text{NP}\)	1997-02-03	Paper
A coarse Tutte polynomial for hypermaps	N/A	Paper

Research outcomes over time

This page was built for person: Steven D. Noble