Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (Q2359983): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q490408
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Fengming Dong / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2607325709 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.04245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic polynomials of some \((m,l)\)-hyperwheels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2875493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Planar Map is Four Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic polynomials of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the location of roots of independence polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The roots of the independence polynomial of a clawfree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs and Ramseyian Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A broken-circuits-theorem for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Polynomials and Their Applications I: The Tutte Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring \(d\)-embeddable \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-concavity of characteristic polynomials and the Bergman fan of matroids / 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: Hypergraph planarity and the complexity of drawing venn diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Graph Polynomials on Graphs of Bounded Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to chromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / 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: Acyclic orientations of graphs / 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: Chromatic coefficients of linear uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sunflower hypergraphs are chromatically unique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of chromatic coefficients of linear uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with pendant paths are not chromatically unique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring mixed hypergraphs: theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on chromatic polynomials of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutpoints and the chromatic polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HYPERGRAPHS / rank
 
Normal rank

Latest revision as of 01:18, 14 July 2024

scientific article
Language Label Description Also known as
English
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
scientific article

    Statements

    Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (English)
    0 references
    0 references
    0 references
    23 June 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    totally cyclic orientations of a graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references