Pages that link to "Item:Q1843453"
From MaRDI portal
The following pages link to The chromatic number and other functions of the lexicographic product (Q1843453):
Displaying 42 items.
- Connectivity and other invariants of generalized products of graphs (Q313405) (← links)
- Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs (Q329557) (← links)
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- On Minkowski space and finite geometry (Q507825) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- Thinness of product graphs (Q831864) (← links)
- On the topological lower bound for the multichromatic number (Q965996) (← links)
- Grundy number and products of graphs (Q968418) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- n-tuple colorings and associated graphs (Q1212006) (← links)
- r-tuple colorings of uniquely colorable graphs (Q1230631) (← links)
- Set colourings of graphs (Q1255964) (← links)
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs (Q1339858) (← links)
- Graph products and the chromatic difference sequence of vertex-transitive graphs (Q1584242) (← links)
- On the fractional chromatic number and the lexicographic product of graphs (Q1584257) (← links)
- A note on the thue chromatic number of lexicographic products of graphs (Q1649901) (← links)
- On the \(b\)-continuity of the lexicographic product of graphs (Q1684933) (← links)
- The chromatic numbers of graph bundles over cycles (Q1842173) (← links)
- Chromatic invariants for finite graphs: Theme and polynomial variations (Q1899442) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- Choosability and paintability of the lexicographic product of graphs (Q2030438) (← links)
- On maximum intersecting sets in direct and wreath product of groups (Q2136206) (← links)
- On indicated coloring of lexicographic product of graphs (Q2161277) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- On the strong metric dimension of the strong products of graphs (Q2257466) (← links)
- The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
- Asymptotic values of the Hall-ratio for graph powers (Q2433717) (← links)
- Set colourings of graphs. (Reprint) (Q2497995) (← links)
- A note on the packing chromatic number of lexicographic products (Q2659160) (← links)
- Maximum induced forests of product graphs (Q2683145) (← links)
- Large cliques and independent sets all over the place (Q4992901) (← links)
- Sierpiński products of r-uniform hypergraphs (Q5045249) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- The total co-independent domination number of some graph operations (Q5101866) (← links)
- The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products (Q5198005) (← links)
- (Q5374253) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- On multichromatic numbers of widely colorable graphs (Q6081566) (← links)
- Smallest maximal matchings of graphs (Q6100387) (← links)
- Acyclic coloring of products of digraphs (Q6130210) (← links)
- Bounds on the Twin-Width of Product Graphs (Q6131799) (← links)
