On zeros of the characteristic polynomial of matroids of bounded tree-width (Q338570): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Constructions for Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Tutte Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Zero-Free Interval for Chromatic Polynomials of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is the five-flow conjecture almost false? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of rank-\(k\) flats in a matroid with no \(U_{2, n}\)-minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: COLOURING, PACKING AND THE CRITICAL PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3656242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Roots are Dense in the Whole Complex Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Zero-Free Intervals for Chromatic Polynomials of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest real zero of the chromatic polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768917 / rank
 
Normal rank

Latest revision as of 20:52, 12 July 2024

scientific article
Language Label Description Also known as
English
On zeros of the characteristic polynomial of matroids of bounded tree-width
scientific article

    Statements

    On zeros of the characteristic polynomial of matroids of bounded tree-width (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2016
    0 references
    \(\mathrm{GF}(q)\)-representable matroid
    0 references

    Identifiers