scientific article; zbMATH DE number 2199828
From MaRDI portal
Publication:5313291
zbMath1070.05038MaRDI QIDQ5313291
Khee Meng Koh, Kee L. Teo, Fengming Dong
Publication date: 26 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)
Related Items (max. 100)
A Most General Edge Elimination Polynomial ⋮ An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) ⋮ Upper bounds on the average number of colors in the non-equivalent colorings of a graph ⋮ Upper bounds on the chromatic polynomial of a connected graph with fixed clique number ⋮ Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph ⋮ DP color functions versus chromatic polynomials (II) ⋮ Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations ⋮ Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II ⋮ CHROMATIC POLYNOMIALS OF n-CENTIPEDE AND TRIANGULAR SNAKE TSn GRAPHS ⋮ On the list color function threshold ⋮ Short certificates for chromatic equivalence ⋮ The Domination Equivalence Classes of Paths ⋮ Linear Recurrence Relations for Graph Polynomials ⋮ Independence Equivalence Classes of Paths and Cycles ⋮ Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Integral-root polynomials and chromatic uniqueness of graphs ⋮ Chromatic zeros on hierarchical lattices and equidistribution on parameter space ⋮ The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial ⋮ Some properties of chromatic coefficients of linear uniform hypergraphs ⋮ Extremal Khovanov homology and the girth of a knot ⋮ Chromatic uniqueness of zero-divisor graphs ⋮ On zeros of the characteristic polynomial of matroids of bounded tree-width ⋮ On the vertex covering sets and vertex cover polynomials of square of ladder graph ⋮ On the real roots of \(\sigma\)-polynomials ⋮ Novel results on partial Hosoya polynomials: an application in chemistry ⋮ On graphs whose flow polynomials have real roots only ⋮ The DP color function of joins and vertex-gluings of graphs ⋮ Polynomials with real zeros via special polynomials ⋮ On the zeros of the partial Hosoya polynomial of graphs ⋮ On sequences of polynomials arising from graph invariants ⋮ Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence ⋮ Exact results on Potts model partition functions in a generalized external field and weighted-set graph colorings ⋮ A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) ⋮ Partial-dual polynomials and signed intersection graphs ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Complexity of the Bollobás-Riordan Polynomial ⋮ Note on some restricted Stirling numbers of the second kind ⋮ On the roots of the subtree polynomial ⋮ On chromatic uniqueness of certain 5-partite graphs ⋮ Graph measures with high discrimination power revisited: a random polynomial approach ⋮ Chromaticity of complete 6-partite graphs with certain star or matching deleted. II ⋮ Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach ⋮ Maximizing the number of \(x\)-colorings of 4-chromatic graphs ⋮ On homotopy types of Vietoris-Rips complexes of metric gluings ⋮ Algebraic integers as chromatic and domination roots ⋮ On the independent domination polynomial of a graph ⋮ Unnamed Item ⋮ A note on the real part of complex chromatic roots ⋮ Circular automata synchronize with high probability ⋮ Graphs whose certain polynomials have few distinct roots ⋮ An abstraction of Whitney's broken circuit theorem ⋮ Pairs of chromatically equivalent graphs ⋮ q-plane zeros of the Potts partition function on diamond hierarchical graphs ⋮ A new family of chromatically unique 6-bridge graph ⋮ On planar and non-planar graphs having no chromatic zeros in the interval(1,2) ⋮ A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\) ⋮ An introduction to the k-defect polynomials ⋮ Patterns in Khovanov link and chromatic graph homology ⋮ Independence equivalence classes of cycles ⋮ On the adjacency, Laplacian, and signless Laplacian spectrum of coalescence of complete graphs ⋮ ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS ⋮ Chromatic roots and limits of dense graphs ⋮ Domination numbers and zeros of chromatic polynomials ⋮ Acyclic polynomials of graphs ⋮ Bipartite graphs as polynomials and polynomials as bipartite graphs ⋮ Extremal colorings and independent sets ⋮ Weighted graph colorings ⋮ A maximal zero-free interval for chromatic polynomials of bipartite planar graphs ⋮ On the absolute sum of chromatic polynomial coefficient of graphs ⋮ Weighted-set graph colorings ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ Series-parallel chromatic hypergraphs ⋮ Independence roots and independence fractals of certain graphs ⋮ A little statistical mechanics for the graph theorist ⋮ Unnamed Item ⋮ A logician's view of graph polynomials ⋮ Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions ⋮ On roots of Wiener polynomials of trees ⋮ On Garlands in \(\chi\)-uniquely colorable graphs ⋮ Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind ⋮ Restraints permitting the largest number of colourings ⋮ On the roots of Wiener polynomials of graphs ⋮ Chromatic polynomials of mixed hypercycles ⋮ A note on a broken-cycle theorem for hypergraphs ⋮ About chromatic uniqueness of some complete tripartite graphs ⋮ The chromatic equivalence class of \(K_{1, n, n + 2}\) ⋮ Domination polynomial of clique cover product of graphs ⋮ Problems on chromatic polynomials of hypergraphs ⋮ On the location of roots of graph polynomials ⋮ Unnamed Item ⋮ Limit theorems for monochromatic stars ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials ⋮ The Second-Moment Phenomenon for Monochromatic Subgraphs ⋮ CHROMATIC POLYNOMIALS OF K_{m}+P_{n}, K_{m}+C_{n} AND G\circ H ⋮ Recursion relations for chromatic coefficients for graphs and hypergraphs ⋮ Mean color numbers of some graphs ⋮ Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs ⋮ On total edge fixed geodomination sets and polynomials of paths ⋮ DP color functions versus chromatic polynomials ⋮ The maximum number of colorings of graphs of given order and size: a survey
This page was built for publication:
