Pages that link to "Item:Q1339858"
From MaRDI portal
The following pages link to On the chromatic number of the lexicographic product and the Cartesian sum of graphs (Q1339858):
Displaying 21 items.
- \([r,s,t]\)-colorings of graph products (Q742628) (← links)
- Bounds on the domination number and the metric dimension of co-normal product of graphs (Q824651) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- The chromatic difference sequence of the Cartesian product of graphs. II (Q1208488) (← links)
- Improved bounds for the chromatic number of the lexicographic product of graphs (Q1345197) (← links)
- Relaxed coloring of a graph (Q1393026) (← links)
- On the fractional chromatic number and the lexicographic product of graphs (Q1584257) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- On the \(b\)-chromatic number of Cartesian products (Q1706119) (← links)
- Gromov hyperbolicity in the Cartesian sum of graphs (Q1734079) (← links)
- Strong products of \(\chi\)-critical graphs (Q1801332) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- On the strong metric dimension of the strong products of graphs (Q2257466) (← links)
- Modular decomposition of graphs and the distance preserving property (Q2312661) (← links)
- Some properties on the lexicographic product of graphs obtained by monogenic semigroups (Q2637547) (← links)
- A note on the packing chromatic number of lexicographic products (Q2659160) (← links)
- Coloring the Cartesian Sum of Graphs (Q3439356) (← links)
- (Q5499966) (← links)
- On the local antimagic chromatic number of the lexicographic product of graphs (Q5889963) (← links)
- Strong resolving partitions for strong product graphs and Cartesian product graphs (Q5962517) (← links)
- On automorphisms and fixing number of co-normal product of graphs (Q6669292) (← links)