On the public citation graph

Homomorphisms Of Graphs And Automata.

https://doi.org/10.7302/14840
0 signed · 89 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.20117openalex-snapshot
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak‐Rödl function
inferred← citeshttps://doi.org/10.1002/jgt.20194openalex-snapshot
Independent sets in tensor graph powers
inferred← citeshttps://doi.org/10.1002/jgt.20575openalex-snapshot
The chromatic Ramsey number of odd wheels
inferred← citeshttps://doi.org/10.1002/jgt.3190090409openalex-snapshot
On the chromatic number of the product of graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190150503openalex-snapshot
Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs
inferred← citeshttps://doi.org/10.1002/jgt.70094openalex-snapshot
Explicit 3‐colorings for Exponential Graphs
inferred← citeshttps://doi.org/10.1007/3-540-33700-8_24openalex-snapshot
On the Algorithmic Aspects of Hedetniemi’s Conjecture
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_10openalex-snapshot
Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_11openalex-snapshot
Spectral Properties of Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_5openalex-snapshot
Independent Sets and Matchings
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_6openalex-snapshot
Eulerian and Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-62497-2_31openalex-snapshot
Note on Hedetniemi’s Conjecture and the Poljak-Rödl Function
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_23openalex-snapshot
Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_8openalex-snapshot
My Top 10 Graph Theory Conjectures and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_4openalex-snapshot
Graph homomorphisms: structure and symmetry
inferred← citeshttps://doi.org/10.1007/bf01189000openalex-snapshot
Graph algebras and graph varieties
inferred← citeshttps://doi.org/10.1007/bf02122553openalex-snapshot
On multiplicative graphs and the product conjecture
inferred← citeshttps://doi.org/10.1007/bf02476673openalex-snapshot
Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
inferred← citeshttps://doi.org/10.1007/bf02579374openalex-snapshot
The chromatic number of the product of two 4-chromatic graphs is 4
inferred← citeshttps://doi.org/10.1007/bf02579376openalex-snapshot
The chromatic number of the product of two ℵ1-chromatic graphs can be countable
inferred← citeshttps://doi.org/10.1007/bfb0059422openalex-snapshot
Graphical theorems of the Nordhaus-Gaddum class
inferred← citeshttps://doi.org/10.1007/bfb0091831openalex-snapshot
Graphs and universal algebras
inferred← citeshttps://doi.org/10.1007/pl00022468openalex-snapshot
Antivarieties and colour-families of graphs
inferred← citeshttps://doi.org/10.1007/s00010-013-0207-9openalex-snapshot
Coloring, location and domination of corona graphs
inferred← citeshttps://doi.org/10.1007/s00283-012-9275-2openalex-snapshot
Sketchy Tweets: Ten Minute Conjectures in Graph Theory
inferred← citeshttps://doi.org/10.1007/s00454-019-00090-1openalex-snapshot
$$\mathbb {Z}_2$$-Indices and Hedetniemi’s Conjecture
inferred← citeshttps://doi.org/10.1007/s004930070006openalex-snapshot
Hedetniemi's Conjecture and the Retracts of a Product of Graphs
inferred← citeshttps://doi.org/10.1007/s10012-000-0129-zopenalex-snapshot
The Pseudoachromatic Number of a Graph
inferred← citeshttps://doi.org/10.1007/s10485-017-9484-0openalex-snapshot
Hedetniemi’s Conjecture and Adjoint Functors in Thin Categories
inferred← citeshttps://doi.org/10.1007/s11083-010-9162-4openalex-snapshot
Hedetniemi’s Conjecture and Dense Boolean Lattices
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90084-3openalex-snapshot
Walkwise and admissible mappings between digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00212-2openalex-snapshot
The chromatic numbers of graph bundles over cycles
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00298-wopenalex-snapshot
Lattices arising in categorial investigations of Hedetniemi's conjecture
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00377-uopenalex-snapshot
Coloring graph products — A survey
inferred← citeshttps://doi.org/10.1016/0095-8956(71)90065-7openalex-snapshot
Graphs with forbidden subgraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(75)90076-3openalex-snapshot
The chromatic number and other functions of the lexicographic product
inferred← citeshttps://doi.org/10.1016/0378-8733(83)90025-4openalex-snapshot
Graph and semigroup homomorphisms on networks of relations
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00189-1openalex-snapshot
Edge exchanges in hamiltonian decompositions of Kronecker-product graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2014.03.007openalex-snapshot
Some properties on the tensor product of graphs obtained by monogenic semigroups
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.009openalex-snapshot
Computing global offensive alliances in Cartesian product graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.044openalex-snapshot
Distance magic graphs G×Cn
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.022openalex-snapshot
Interval edge-colorings of composition of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.04.003openalex-snapshot
Thinness of product graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.04.013openalex-snapshot
Independence and coloring properties of direct products of some vertex-transitive graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.005openalex-snapshot
Coloring the Cartesian sum of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.09.020openalex-snapshot
Grundy number and products of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.02.007openalex-snapshot
Altermatic number of categorical product of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.03.013openalex-snapshot
Interleaved adjoints of directed graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.07.006openalex-snapshot
Beautiful conjectures in graph theory
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.05.004openalex-snapshot
Symplectic graphs over finite commutative rings
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103086openalex-snapshot
Reconfiguring graph homomorphisms on the sphere
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.045openalex-snapshot
Coloring the Cartesian Sum of Graphs
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.03.001openalex-snapshot
Orthogonal graphs over finite commutative rings of odd characteristic
inferred← citeshttps://doi.org/10.1016/j.jcta.2022.105721openalex-snapshot
Hedetniemi's conjecture from the topological viewpoint
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.06.002openalex-snapshot
Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.09.005openalex-snapshot
Relatively small counterexamples to Hedetniemi's conjecture
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.045openalex-snapshot
On maximum independent set of categorical product and ultimate categorical ratios of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00102-9openalex-snapshot
The level of nonmultiplicativity of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00312-0openalex-snapshot
On the fractional chromatic number, the chromatic number, and graph products
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00450-2openalex-snapshot
On Hedetniemi's conjecture and the colour template scheme
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00171-4openalex-snapshot
Graph products and the chromatic difference sequence of vertex-transitive graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00047-8openalex-snapshot
Chromatic Ramsey numbers
inferred← citeshttps://doi.org/10.1016/s0019-9958(68)90738-9openalex-snapshot
On relational homomorphisms of automata
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00022-4openalex-snapshot
Long cycles and long paths in the Kronecker product of a cycle and a tree
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00263-8openalex-snapshot
Density via duality
inferred← citeshttps://doi.org/10.1090/dimacs/063/13openalex-snapshot
Chromatic numbers of products of tournaments: Fractional aspects of Hedetniemi’s conjecture
inferred← citeshttps://doi.org/10.1103/physreva.102.062402openalex-snapshot
Minimal distances for certain quantum product codes and tensor products of chain complexes
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17773.xopenalex-snapshot
AN INTRODUCTION TO THE CATEGORY OF GRAPHS*
inferred← citeshttps://doi.org/10.1137/1.9781611975994.97openalex-snapshot
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
inferred← citeshttps://doi.org/10.1137/21m1414620openalex-snapshot
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
inferred← citeshttps://doi.org/10.14418/wes01.3.66openalex-snapshot
Fractional Chromatic Numbers of Incidence Graphs
inferred← citeshttps://doi.org/10.31274/rtd-180813-12503openalex-snapshot
Hypercubes, median graphs and products of graphs: some algorithmic and combinatorial results
inferred← citeshttps://doi.org/10.3934/math.2020419openalex-snapshot
On the r-dynamic coloring of the direct product of a path with either a path or a cycle
inferred← citeshttps://doi.org/10.4007/annals.2019.190.2.6openalex-snapshot
Counterexamples to Hedetniemi's conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.0710.4477openalex-snapshot
Homomorphisms and Structural Properties of Relational Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1202.5720openalex-snapshot
When is the Direct Product of Generalized Mycielskians a Cover Graph?
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0494openalex-snapshot
Computing global offensive alliances in Cartesian product graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0647openalex-snapshot
Coloring, location and domination of corona graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4237openalex-snapshot
Independent set in categorical products of cographs and splitgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1508.00158openalex-snapshot
Interval edge-colorings of composition of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1607.08453openalex-snapshot
Fall-colorings and b-colorings of graph products
inferred← citeshttps://doi.org/10.48550/arxiv.1710.05290openalex-snapshot
Z2-indices and Hedetniemi's conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1803.01505openalex-snapshot
On Chromatic Core Subgraph of Simple Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2002.03766openalex-snapshot
Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products
inferred← citeshttps://doi.org/10.48550/arxiv.2012.13558openalex-snapshot
Smaller counterexamples to Hedetniemi's conjecture
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v20i2.74490openalex-snapshot
Orthogonal colourings of tensor graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1023openalex-snapshot
Associative graph products and their independence, domination and coloring numbers
inferred← citeshttps://doi.org/10.7151/dmgt.1057openalex-snapshot
Isomorphic components of Kronecker product of bipartite graphs
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.