Coloring graph products---a survey
From MaRDI portal
Publication:1923489
DOI10.1016/0012-365X(94)00377-UzbMath0857.05035OpenAlexW2032331898WikidataQ64356951 ScholiaQ64356951MaRDI QIDQ1923489
Publication date: 12 November 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00377-u
Related Items
Thinness of product graphs ⋮ Dominator and total dominator coloring of circulant graph Cn(1, 2) ⋮ Some properties on the lexicographic product of graphs obtained by monogenic semigroups ⋮ On the Hadwiger's conjecture for graph products ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ The independence number of the strong product of cycles ⋮ Chromatic vertex Folkman numbers ⋮ Partially concurrent open shop scheduling with integral preemptions ⋮ Dominated coloring in product graphs ⋮ Relatively small counterexamples to Hedetniemi's conjecture ⋮ Unnamed Item ⋮ Bounded colouring motivated by the limited resource partially concurrent open shop problem ⋮ On robust colorings of Hamming-distance graphs ⋮ Counterexamples to Hedetniemi's conjecture ⋮ A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function ⋮ Coloring the Cartesian sum of graphs ⋮ Fuzzy chromatic number of union of fuzzy graphs: an algorithm, properties and its application ⋮ The antistrong property for special digraph families ⋮ SOME PROPERTIES ON THE DISJUNCTIVE PRODUCT OVER GRAPHS OF MONOGENIC SEMIGROUPS ⋮ ON THE CORONA PRODUCT OF MONOGENIC SEMIGROUP GRAPHS ⋮ ON FUZZY CHROMATIC NUMBER OF CARTESIAN PRODUCT OF SOME FUZZY GRAPHS AND ITS APPLICATION ⋮ Note on Hedetniemi's conjecture and the Poljak-Rödl function ⋮ Unnamed Item ⋮ The thickness of the Kronecker product of graphs ⋮ A note on the Poljak-Rödl function ⋮ On the fractional chromatic number and the lexicographic product of graphs ⋮ Game chromatic number of strong product graphs ⋮ Coloring the Cartesian Sum of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the prime factors of strong direct product graphs in polynomial time
- Retracts of strong products of graphs
- Two remarks on retracts of graph products
- Kneser's conjecture, chromatic number, and homotopy
- Symmetric graphs and interpretations
- The chromatic number of the product of two 4-chromatic graphs is 4
- The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
- On multiplicative graphs and the product conjecture
- On the arc-chromatic number of a digraph
- Multiplicative posets
- n-tuple colorings and associated graphs
- r-tuple colorings of uniquely colorable graphs
- Strong products of Kneser graphs
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Improved bounds for the chromatic number of the lexicographic product of graphs
- Strong products of \(\chi\)-critical graphs
- The chromatic number and other functions of the lexicographic product
- Graphs with Given Group and Given Graph-Theoretical Properties
- On the chromatic number of the product of graphs
- A note on the chromatic number of the alternative negation of two graphs
- Analogues of the Shannon Capacity of a Graph
- Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs
- Multiplicativity. Part II. Nonmultiplicative digraphs and characterization of oriented paths
- An approach to hedetniemi's conjecture
- Applications of product colouring
- The Complexity of Near-Optimal Graph Coloring
- Chromatic Number of Cartesian Sum of Two Graphs
- The Categorical Product of Graphs
- On chromatic number of products of two graphs
- Independence numbers of product graphs
