Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Q3449868): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q164658 / rank
Normal rank
 
Property / author
 
Property / author: Alan D. Sokal / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107791854 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.1721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for series parallel graphs and graphs with treewidth two / rank
 
Normal rank
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: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of Zeros of Chromatic and Related Polynomials of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lambert \(w\) function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic roots - some observations and conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Random-Cluster Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeros of chromatic and flow polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex zero-free regions at large \(|q|\) for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxmaxflow and counting subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Brown-Colbourn conjecture on zeros of reliability polynomials is false / 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: Q3416249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / 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 Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeros of Reliability Polynomials and <i>f</i>-vectors of Matroids / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:27, 11 July 2024

scientific article
Language Label Description Also known as
English
Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
scientific article

    Statements

    Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 October 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    chromatic polynomial
    0 references
    multivariate Tutte polynomial
    0 references
    antiferromagnetic Potts model
    0 references
    chromatic roots
    0 references
    maxmaxflow
    0 references
    series-parallel graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references