The chromatic number and other functions of the lexicographic product
From MaRDI portal
Publication:1843453
DOI10.1016/0095-8956(75)90076-3zbMath0282.05114OpenAlexW1982982957MaRDI QIDQ1843453
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(75)90076-3
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items
Thinness of product graphs, Sierpiński products of r-uniform hypergraphs, On the chromatic number of the lexicographic product and the Cartesian sum of graphs, On maximum intersecting sets in direct and wreath product of groups, Connectivity and other invariants of generalized products of graphs, Chromatic invariants for finite graphs: Theme and polynomial variations, Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs, A note on the thue chromatic number of lexicographic products of graphs, Closed formulae for the strong metric dimension of lexicographic product graphs, On indicated coloring of lexicographic product of graphs, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, A note on the packing chromatic number of lexicographic products, Coloring graph products---a survey, On the \(b\)-continuity of the lexicographic product of graphs, The total co-independent domination number of some graph operations, On multichromatic numbers of widely colorable graphs, Smallest maximal matchings of graphs, Maximum induced forests of product graphs, Acyclic coloring of products of digraphs, On locally identifying coloring of graphs, Asymptotic values of the Hall-ratio for graph powers, Classes of graphs with low complexity: the case of classes with bounded linear rankwidth, On Minkowski space and finite geometry, Hedetniemi's conjecture and adjoint functors in thin categories, On the topological lower bound for the multichromatic number, On the strong metric dimension of the strong products of graphs, Grundy number and products of graphs, n-tuple colorings and associated graphs, Set colourings of graphs. (Reprint), r-tuple colorings of uniquely colorable graphs, Graph theory (algorithmic, algebraic, and metric problems), The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products, Choosability and paintability of the lexicographic product of graphs, Set colourings of graphs, Parameterized inapproximability of independent set in \(H\)-free graphs, Unnamed Item, Large cliques and independent sets all over the place, The chromatic numbers of graph bundles over cycles, Graph products and the chromatic difference sequence of vertex-transitive graphs, On the fractional chromatic number and the lexicographic product of graphs, Extremal problems concerning Kneser-graphs, The \(k\)-path vertex cover of rooted product graphs
Cites Work
