Three-connected graphs whose maximum nullity is at most three
- 1 July 2008
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 429 (2-3) , 625-632
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Forbidden minors for the class of graphs G withLinear Algebra and its Applications, 2007
- A correction: orthogonal representations and connectivity of graphsLinear Algebra and its Applications, 2000
- Multiplicities of Eigenvalues and Tree-Width of GraphsJournal of Combinatorial Theory, Series B, 1998
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- On Linear Recognition of Tree-Width at Most FourSIAM Journal on Discrete Mathematics, 1996
- Sur un nouvel invariant des graphes et un critère de planaritéJournal of Combinatorial Theory, Series B, 1990
- Forbidden minors characterization of partial 3-treesDiscrete Mathematics, 1990
- Orthogonal representations and connectivity of graphsLinear Algebra and its Applications, 1989
- A characterization of tridiagonal matricesLinear Algebra and its Applications, 1969