Color-families are dense
From MaRDI portal
Publication:1162817
DOI10.1016/0304-3975(82)90129-3zbMath0482.68063OpenAlexW2083507120WikidataQ54310106 ScholiaQ54310106MaRDI QIDQ1162817
Publication date: 1982
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(82)90129-3
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items
The quest for a characterization of hom-properties of finite character, Graph homomorphisms with infinite targets, Oriented incidence colourings of digraphs, Homomorphically full graphs, Lattices arising in categorial investigations of Hedetniemi's conjecture, Fractal property of the graph homomorphism order, Generalised dualities and maximal finite antichains in the homomorphism order of relational structures, On the order of countable graphs, Tension continuous maps -- their structure and applications, Many Facets of Dualities, On minimal graphs, Power languages and density, On the interval of strong partial clones of Boolean functions containing \(\mathrm{Pol}(\{(0, 0), (0, 1), (1, 0)\})\), On the complexity of colouring by superdigraphs of bipartite graphs, The core of a graph, Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms, Graph theory (algorithmic, algebraic, and metric problems), The homomorphism lattice induced by a finite algebra, Universality of intervals of line graph order, A surprising permanence of old motivations (a not-so-rigid story), Fractional multiples of graphs and the density of vertex-transitive graphs, Hereditarily hard \(H\)-colouring problems, Core-like properties of infinite graphs and structures, Finitary and infinitary interpretations of languages, Duality theorems for finite structures (characterising gaps and good characterisations), Density via duality., Symmetric graphs and interpretations, Homomorphisms of 3-chromatic graphs, Subdivision of the hierarchy of H-colorable graph classes by circulant graphs, Circular colouring and graph homomorphism
Cites Work
