On the public citation graph

Chromatic Polynomials and Chromaticity of Graphs

https://doi.org/10.1142/5814
0 signed · 162 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.20614openalex-snapshot
The 3‐connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial
inferred← citeshttps://doi.org/10.1002/jgt.22487openalex-snapshot
On the imaginary parts of chromatic roots
inferred← citeshttps://doi.org/10.1002/jgt.22505openalex-snapshot
New expressions for order polynomials and chromatic polynomials
inferred← citeshttps://doi.org/10.1002/jgt.22617openalex-snapshot
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
inferred← citeshttps://doi.org/10.1002/jgt.22944openalex-snapshot
DP color functions versus chromatic polynomials (II)
inferred← citeshttps://doi.org/10.1002/jgt.23045openalex-snapshot
On the list color function threshold
inferred← citeshttps://doi.org/10.1002/mma.7485openalex-snapshot
Applications of constructed new families of generating‐type functions interpolating new and known classes of polynomials and numbers
inferred← citeshttps://doi.org/10.1002/rsa.20856openalex-snapshot
Limit theorems for monochromatic stars
inferred← citeshttps://doi.org/10.1007/11780342_35openalex-snapshot
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
inferred← citeshttps://doi.org/10.1007/11917496_18openalex-snapshot
Computing Graph Polynomials on Graphs of Bounded Clique-Width
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_9openalex-snapshot
Graph Polynomials and Their Applications I: The Tutte Polynomial
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_15openalex-snapshot
Linear Recurrence Relations for Graph Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_12openalex-snapshot
Complexity of the Bollobás-Riordan Polynomial
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_25openalex-snapshot
On Counting Generalized Colorings
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_4openalex-snapshot
A Most General Edge Elimination Polynomial
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_18openalex-snapshot
Semantic Equivalence of Graph Polynomials Definable in Second Order Logic
inferred← citeshttps://doi.org/10.1007/s00009-018-1130-zopenalex-snapshot
Enumerating Some Stable Partitions Involving Stirling and r-Stirling Numbers of the Second Kind
inferred← citeshttps://doi.org/10.1007/s00214-026-03324-7openalex-snapshot
Size-extensivity and connectedness of first-order exchange energy in symmetry-adapted perturbation theory: a graph-based approach
inferred← citeshttps://doi.org/10.1007/s00224-007-9022-9openalex-snapshot
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
inferred← citeshttps://doi.org/10.1007/s00224-009-9213-7openalex-snapshot
Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions
inferred← citeshttps://doi.org/10.1007/s00373-008-0831-7openalex-snapshot
On the Chromaticity of Multi-Bridge Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-009-0856-6openalex-snapshot
Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-010-0984-zopenalex-snapshot
Pairs of Chromatically Equivalent Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1421-5openalex-snapshot
Extremal Bicyclic 3-Chromatic Graphs
inferred← citeshttps://doi.org/10.1007/s00373-016-1684-0openalex-snapshot
On the Real Roots of $$\sigma $$ σ -Polynomials
inferred← citeshttps://doi.org/10.1007/s00373-018-1951-3openalex-snapshot
Extremal Colorings and Independent Sets
inferred← citeshttps://doi.org/10.1007/s00373-021-02412-8openalex-snapshot
Mean Color Numbers of Some Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02637-9openalex-snapshot
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph
inferred← citeshttps://doi.org/10.1007/s00373-023-02651-xopenalex-snapshot
Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number
inferred← citeshttps://doi.org/10.1007/s00373-024-02794-5openalex-snapshot
Bounds for DP Color Function and Canonical Labelings
inferred← citeshttps://doi.org/10.1007/s00373-024-02824-2openalex-snapshot
Independence Number and Maximal Chromatic Polynomials of Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00500-019-04278-8openalex-snapshot
Graph coloring: a novel heuristic based on trailing path—properties, perspective and applications in structured networks
inferred← citeshttps://doi.org/10.1007/s10255-010-0034-xopenalex-snapshot
Chromatically equivalent pairs of K 4-homeomorphic graphs
inferred← citeshttps://doi.org/10.1007/s10255-013-0206-6openalex-snapshot
Chromaticity of complete 6-partite graphs with certain star or matching deleted II
inferred← citeshttps://doi.org/10.1007/s10955-009-9882-2openalex-snapshot
Weighted Graph Colorings
inferred← citeshttps://doi.org/10.1007/s10955-010-0089-3openalex-snapshot
Exact Results on Potts Model Partition Functions in a Generalized External Field and Weighted-Set Graph Colorings
inferred← citeshttps://doi.org/10.1007/s10955-010-9937-4openalex-snapshot
Weighted-Set Graph Colorings
inferred← citeshttps://doi.org/10.1007/s10955-025-03398-wopenalex-snapshot
Potts Partition Function Zeros and Ground State Entropy on Hanoi Graphs
inferred← citeshttps://doi.org/10.1007/s10955-025-03457-2openalex-snapshot
Exact Potts/Tutte Polynomials for Hammock Chain Graphs
inferred← citeshttps://doi.org/10.1007/s12190-009-0374-yopenalex-snapshot
On chromatic uniqueness of certain 5-partite graphs
inferred← citeshttps://doi.org/10.1007/s12190-010-0389-4openalex-snapshot
Independence roots and independence fractals of certain graphs
inferred← citeshttps://doi.org/10.1007/s12190-023-01967-4openalex-snapshot
The chromatic polynomial of grid graph $$P_3 \square P_n$$
inferred← citeshttps://doi.org/10.1007/s40993-024-00612-8openalex-snapshot
On the characterization of chordal graphs using Horn hypergeometric series
inferred← citeshttps://doi.org/10.1007/s41468-020-00054-yopenalex-snapshot
On homotopy types of Vietoris–Rips complexes of metric gluings
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127379openalex-snapshot
Novel results on partial hosoya polynomials: An application in chemistry
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.007openalex-snapshot
A logician's view of graph polynomials
inferred← citeshttps://doi.org/10.1016/j.crma.2015.12.003openalex-snapshot
Note on some restricted Stirling numbers of the second kind
inferred← citeshttps://doi.org/10.1016/j.dam.2009.09.003openalex-snapshot
Series–parallel chromatic hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.09.015openalex-snapshot
Counting the number of non-equivalent vertex colorings of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.025openalex-snapshot
A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n−3
inferred← citeshttps://doi.org/10.1016/j.dam.2017.01.022openalex-snapshot
Restraints permitting the largest number of colourings
inferred← citeshttps://doi.org/10.1016/j.dam.2022.08.011openalex-snapshot
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.045openalex-snapshot
Domination numbers and zeros of chromatic polynomials
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.063openalex-snapshot
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.030openalex-snapshot
A complete solution to the chromatic equivalence class of graph Bn-7,1,3¯
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.093openalex-snapshot
On planar and non-planar graphs having no chromatic zeros in the interval ( 1 , 2 )
inferred← citeshttps://doi.org/10.1016/j.disc.2009.01.015openalex-snapshot
On the minimum real roots of the adjoint polynomial of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.011openalex-snapshot
A little statistical mechanics for the graph theorist
inferred← citeshttps://doi.org/10.1016/j.disc.2014.04.007openalex-snapshot
A note on the real part of complex chromatic roots
inferred← citeshttps://doi.org/10.1016/j.disc.2014.12.013openalex-snapshot
The chromatic equivalence class of K 1 , n , n + 2
inferred← citeshttps://doi.org/10.1016/j.disc.2015.04.021openalex-snapshot
New bounds for chromatic polynomials and chromatic roots
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.009openalex-snapshot
Chromatic roots and limits of dense graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.010openalex-snapshot
The maximum number of colorings of graphs of given order and size: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111643openalex-snapshot
On roots of Wiener polynomials of trees
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112134openalex-snapshot
Zero-free intervals of chromatic polynomials of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112605openalex-snapshot
Independence equivalence classes of cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113093openalex-snapshot
The DP color function of joins and vertex-gluings of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113701openalex-snapshot
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (II)
inferred← citeshttps://doi.org/10.1016/j.dt.2018.05.002openalex-snapshot
Novel colored flames via chromaticity of essential colors
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.05.006openalex-snapshot
An extension of the bivariate chromatic polynomial
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.03.003openalex-snapshot
On the location of roots of graph polynomials
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.08.011openalex-snapshot
On zeros of the characteristic polynomial of matroids of bounded tree-width
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.04.006openalex-snapshot
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.06.007openalex-snapshot
Monochromatic subgraphs in randomly colored graphons
inferred← citeshttps://doi.org/10.1016/j.endm.2013.07.033openalex-snapshot
On the Location of Roots of Graph Polynomials
inferred← citeshttps://doi.org/10.1016/j.ins.2018.07.072openalex-snapshot
Graph measures with high discrimination power revisited: A random polynomial approach
inferred← citeshttps://doi.org/10.1016/j.ins.2018.08.043openalex-snapshot
Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach
inferred← citeshttps://doi.org/10.1016/j.ins.2020.03.011openalex-snapshot
On the zeros of the partial Hosoya polynomial of graphs
inferred← citeshttps://doi.org/10.1016/j.jaubas.2017.03.003openalex-snapshot
A new method for proving dominating uniqueness of graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2020.105356openalex-snapshot
Circular automata synchronize with high probability
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.10.005openalex-snapshot
A proof of Tomescu's graph coloring conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.01.002openalex-snapshot
Maximum number of colourings: 4-chromatic graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.02.002openalex-snapshot
An improved lower bound of P(G,L)−P(G,k) for k-assignments L
inferred← citeshttps://doi.org/10.1016/j.physa.2019.123059openalex-snapshot
Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.006openalex-snapshot
Chromatic polynomials
inferred← citeshttps://doi.org/10.1017/fms.2022.62openalex-snapshot
Partial-dual polynomials and signed intersection graphs
inferred← citeshttps://doi.org/10.1017/s0963548308009449openalex-snapshot
Bounds For The Real Zeros of Chromatic Polynomials
inferred← citeshttps://doi.org/10.1063/1.4995832openalex-snapshot
Chromatic uniqueness of 6-bridge graph θ(3,3,b,c,c,c)
inferred← citeshttps://doi.org/10.1063/5.0134592openalex-snapshot
Chromatic polynomial of graphs chain
inferred← citeshttps://doi.org/10.1063/5.0154028openalex-snapshot
Chromatic polynomial of complement of a cycle
inferred← citeshttps://doi.org/10.1063/5.0330845openalex-snapshot
Chromaticity of a type of 6-bridge graphs
inferred← citeshttps://doi.org/10.1080/00207160701828090openalex-snapshot
From rankings’ collinearity to counting SDR's via chromatic list expression
inferred← citeshttps://doi.org/10.1080/09720529.2013.800313openalex-snapshot
On total edge fixed geodomination sets and polynomials of paths
inferred← citeshttps://doi.org/10.1080/09720529.2015.1101884openalex-snapshot
On the vertex covering sets and vertex cover polynomials of square of ladder graph
inferred← citeshttps://doi.org/10.1080/09720529.2021.1891697openalex-snapshot
Integral-root polynomials and chromatic uniqueness of graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/890/1/012116openalex-snapshot
The chromaticity of a family of 6-bridge graph
inferred← citeshttps://doi.org/10.1088/1751-8113/45/21/215202openalex-snapshot
The structure of chromatic polynomials of planar triangulations and implications for chromatic zeros and asymptotic limiting quantities
inferred← citeshttps://doi.org/10.1088/1751-8113/45/5/055212openalex-snapshot
Chromatic polynomials of planar triangulations, the Tutte upper bound and chromatic zeros
inferred← citeshttps://doi.org/10.1093/logcom/exq006openalex-snapshot
Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas
inferred← citeshttps://doi.org/10.1103/physreve.83.041109openalex-snapshot
Ground state entropy of the Potts antiferromagnet on homeomorphic expansions of kagomé lattice strips
inferred← citeshttps://doi.org/10.1103/physrevx.12.011050openalex-snapshot
Hilbert Space Fragmentation and Commutant Algebras
inferred← citeshttps://doi.org/10.1109/iacsit-sc.2009.125openalex-snapshot
A Family of Chromatically Unique k-Bridge Graphs
inferred← citeshttps://doi.org/10.1134/s0040577926090035openalex-snapshot
Boundary chromatic and flow polynomials: Their combinatorics and physical applications
inferred← citeshttps://doi.org/10.1134/s1063739716020062openalex-snapshot
Photoelectric and optical properties of Schottky-barrier photodiodes based on IrSi–Si
inferred← citeshttps://doi.org/10.1137/04061787xopenalex-snapshot
On Graphs Having No Chromatic Zeros in (1,2)
inferred← citeshttps://doi.org/10.1137/070698294openalex-snapshot
On Zero-Free Intervals in $(1,2)$ of Chromatic Polynomials of Some Families of Graphs
inferred← citeshttps://doi.org/10.1140/epjs/s11734-025-01933-0openalex-snapshot
Newly generated path graph matching-polynomial matrix of integration to solve initial-value, finite-value and infinite-boundary-value problems
inferred← citeshttps://doi.org/10.1142/9789814447973_0012openalex-snapshot
FROM UNCERTAIN PROTEIN INTERACTION NETWORKS TO SIGNALING PATHWAYS THROUGH INTENSIVE COLOR CODING
inferred← citeshttps://doi.org/10.1142/s0218216518400072openalex-snapshot
Patterns in Khovanov link and chromatic graph homology
inferred← citeshttps://doi.org/10.1142/s0218216522500833openalex-snapshot
Extremal Khovanov homology and the girth of a knot
inferred← citeshttps://doi.org/10.1142/s0219498821500833openalex-snapshot
Bipartite graphs as polynomials and polynomials as bipartite graphs
inferred← citeshttps://doi.org/10.1155/2011/271987openalex-snapshot
On the Absolute Sum of ChromaticPolynomial Coefficient of Graphs
inferred← citeshttps://doi.org/10.1155/2012/780765openalex-snapshot
Algebraic Integers as Chromatic and Domination Roots
inferred← citeshttps://doi.org/10.1155/2013/195818openalex-snapshot
Graphs Whose Certain Polynomials Have Few Distinct Roots
inferred← citeshttps://doi.org/10.11575/cdm.v9i2.62169openalex-snapshot
Chromatic polynomials of some sunflower mixed hypergraphs
inferred← citeshttps://doi.org/10.1214/16-aap1176openalex-snapshot
Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms
inferred← citeshttps://doi.org/10.1214/16-aap1205openalex-snapshot
Universal limit theorems in graph coloring problems with connections to extremal combinatorics
inferred← citeshttps://doi.org/10.12677/pm.2021.116125openalex-snapshot
The Chromatic Equivalence Classes of the Complements of Union Graphs of r Vertices and a Cycle
inferred← citeshttps://doi.org/10.13189/ms.2023.110415openalex-snapshot
Overtrees and Their Chromatic Polynomials
inferred← citeshttps://doi.org/10.1371/journal.pone.0011393openalex-snapshot
New Polynomial-Based Molecular Descriptors with Low Degeneracy
inferred← citeshttps://doi.org/10.1371/journal.pone.0028328openalex-snapshot
Location of Zeros of Wiener and Distance Polynomials
inferred← citeshttps://doi.org/10.15826/umj.2021.1.004openalex-snapshot
ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS
inferred← citeshttps://doi.org/10.2298/aadm0902330aopenalex-snapshot
Chromatic zeros and generalized Fibonacci numbers
inferred← citeshttps://doi.org/10.25394/pgs.12331136.v1openalex-snapshot
Some Connections Between Complex Dynamics and Statistical Mechanics
inferred← citeshttps://doi.org/10.26493/1855-3974.229.03eopenalex-snapshot
From spanning forests to edge subsets
inferred← citeshttps://doi.org/10.2989/16073606.2018.1443168openalex-snapshot
An introduction to the k-defect polynomials
inferred← citeshttps://doi.org/10.30538/oms2019.0083openalex-snapshot
On chromatic polynomial of certain families of dendrimer graphs
inferred← citeshttps://doi.org/10.31642/jokmc/2018/0202013openalex-snapshot
CHROMATICITY OF WHEELS WITH MISSING THREE SPOKES
inferred← citeshttps://doi.org/10.3390/a16050223openalex-snapshot
Stirling Numbers of Uniform Trees and Related Computational Experiments
inferred← citeshttps://doi.org/10.3390/axioms15030162openalex-snapshot
The Bichromatic Triangle Coloring Polynomial of Some 2-Trees
inferred← citeshttps://doi.org/10.3390/math10020193openalex-snapshot
Zero-Free Intervals of Chromatic Polynomials of Mixed Hypergraphs
inferred← citeshttps://doi.org/10.37236/1019openalex-snapshot
Graphs with Chromatic Roots in the Interval $(1,2)$
inferred← citeshttps://doi.org/10.37236/183openalex-snapshot
Some Results on Chromatic Polynomials of Hypergraphs
inferred← citeshttps://doi.org/10.37236/2072openalex-snapshot
The Covered Components Polynomial: A New Representation of the Edge Elimination Polynomial
inferred← citeshttps://doi.org/10.37236/4356openalex-snapshot
An Abstraction of Whitney's Broken Circuit Theorem
inferred← citeshttps://doi.org/10.37236/638openalex-snapshot
Chromatic Roots of a Ring of Four Cliques
inferred← citeshttps://doi.org/10.4171/aihpd/109openalex-snapshot
Chromatic zeros on hierarchical lattices and equidistribution on parameter space
inferred← citeshttps://doi.org/10.4213/tmf11106openalex-snapshot
Условные хроматические и потоковые многочлены: их комбинаторика и физические приложения
inferred← citeshttps://doi.org/10.46298/dmtcs.2117openalex-snapshot
On the 1-2-3-conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.0712.3112openalex-snapshot
A most general edge elimination graph polynomial
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2342openalex-snapshot
Partial profiles of quasi-complete graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0812.1364openalex-snapshot
Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas
inferred← citeshttps://doi.org/10.48550/arxiv.0911.1587openalex-snapshot
Mathematical Proofs of Two Conjectures: The Four Color Problem and The Uniquely 4-colorable Planar Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1101.5826openalex-snapshot
Exact Results on Potts/Tutte Polynomials for Families of Networks with Edge and Vertex Inflations
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0698openalex-snapshot
A generalization of the Birthday problem and the chromatic polynomial
inferred← citeshttps://doi.org/10.48550/arxiv.1205.2205openalex-snapshot
Proving properties of the edge elimination polynomial using equivalent graph polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1309.1941openalex-snapshot
On the location of roots of graph polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1402.0731openalex-snapshot
Some applications of the chromatic polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1605.02291openalex-snapshot
Domination polynomial of clique cover product of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1710.06535openalex-snapshot
Maximum number of colourings. II. 5-chromatic graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1711.01465openalex-snapshot
The Second Moment Phenomenon for Monochromatic Subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1810.05317openalex-snapshot
Independence Equivalence Classes of Paths and Cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1907.07376openalex-snapshot
Formulas counting spanning trees in line graphs and their extensions
inferred← citeshttps://doi.org/10.48550/arxiv.2011.01735openalex-snapshot
Acyclic polynomials of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.01823openalex-snapshot
Partial-dual genus polynomials and signed intersection graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2104.00552openalex-snapshot
Using Graph Theory to Derive Inequalities for the Bell Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.2106.06702openalex-snapshot
More on total domination polynomial and $\mathcal{D}_t$-equivalence classes of some graphs
inferred← citeshttps://doi.org/10.5802/crmath.147openalex-snapshot
Polynomials with real zeros via special polynomials
inferred← citeshttps://doi.org/10.7151/dmgt.1734openalex-snapshot
A note on a broken-cycle theorem for hypergraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1750openalex-snapshot
Chromatic polynomials of mixed hypercycles
inferred← citeshttps://doi.org/10.7151/dmgt.2248openalex-snapshot
Recursion relations for chromatic coefficients for graphs and hypergraphs
inferred← citeshttps://doi.org/10.7726/cms.2013.1005openalex-snapshot
Extension of Chromatic Polynomials by Utilizing Mobius Inversion Theorem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.