Steven D. Noble - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2021

Delta-matroids as subsystems of sequences of Higgs liftsJoseph E. Bonin, Carolyn Chun, Steven D. Noble. aam, 126:101910, 2021. [doi]

The excluded 3-minors for vf-safe delta-matroidsJoseph E. Bonin, Carolyn Chun, Steven D. Noble. aam, 126:101909, 2021. [doi]

2019

The e-exchange basis graph and matroid connectednessCarolyn Chun, Deborah Chun, Tyler Moss, Steven D. Noble. DM, 342(3):723-725, 2019. [doi]

Matroids, delta-matroids and embedded graphsCarolyn Chun, Iain Moffatt, Steven D. Noble, Ralf Rueckriemen. JCT, 167:7-59, 2019. [doi]

The complexity of solution-free sets of integers for general linear equationsKeith J. Edwards, Steven D. Noble. DAM, 270:115-133, 2019. [doi]

2018

2017

On zeros of the characteristic polynomial of matroids of bounded tree-widthCarolyn Chun, Rhiannon Hall, Criel Merino, Steven D. Noble. ejc, 60:10-20, 2017. [doi]

Inductive tools for connected delta-matroids and multimatroidsCarolyn Chun, Deborah Chun, Steven D. Noble. ejc, 63:59-69, 2017. [doi]

2014

The Merino-Welsh conjecture holds for series-parallel graphsSteven D. Noble, Gordon F. Royle. ejc, 38:24-35, 2014. [doi]

2012

The complexity of two graph orientation problemsNicole Eggemann, Steven D. Noble. DAM, 160(4-5):513-517, 2012. [doi]

On the structure of the h-vector of a paving matroidCriel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez, Rafael Villarroel-Flores. ejc, 33(8):1787-1799, 2012. [doi]

2011

Some inequalities for the Tutte polynomialLaura Chávez-Lomelí, Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez. ejc, 32(3):422-433, 2011. [doi]

The clustering coefficient of a scale-free random graphNicole Eggemann, Steven D. Noble. DAM, 159(10):953-965, 2011. [doi]

The Tutte polynomial characterizes simple outerplanar graphsAndrew J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy. endm, 38:639-644, 2011. [doi]

The Tutte Polynomial Characterizes Simple Outerplanar GraphsA. J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy. cpc, 20(4):609-616, 2011. [doi]

Maximizing edge-ratio is NP-completeSteven D. Noble, Pierre Hansen, Nenad Mladenovic. DAM, 159(18):2276-2280, 2011. [doi]

2010

k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4Nicole Eggemann, Frédéric Havet, Steven D. Noble. DAM, 158(16):1777-1788, 2010. [doi]

2009

Minimizing the Oriented Diameter of a Planar GraphNicole Eggemann, Steven D. Noble. endm, 34:267-271, 2009. [doi]

The Equivalence of Two Graph Polynomials and a Symmetric FunctionCriel Merino, Steven D. Noble. cpc, 18(4):601-615, 2009. [doi]

2002

Optimal arrangement of data in a tree directoryMalwina J. Luczak, Steven D. Noble. DAM, 121(1-3):307-315, 2002.

2001

Optimal arrangement of data in a tree directoryMalwina J. Luczak, Steven D. Noble. DAM, 113(2-3):243-253, 2001.

Sign in or sign up to see more results.

runs on WebDSL