Pages that link to "Item:Q4016022"
From MaRDI portal
The following pages link to Star chromatic numbers and products of graphs (Q4016022):
Displayed 43 items.
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- The fractional version of Hedetniemi's conjecture is true (Q648973) (← links)
- \([r,s,t]\)-colorings of graph products (Q742628) (← links)
- An analogue of Dirac's theorem on circular super-critical graphs (Q875063) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- Measure preserving homomorphisms and independent sets in tensor graph powers (Q1011734) (← links)
- Paths, cycles and circular colorings in digraphs (Q1019171) (← links)
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers (Q1025479) (← links)
- The circular chromatic number of hypergraphs (Q1045069) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
- Star chromatic number of triangle-free planar graphs (Q1324451) (← links)
- Some theorems concerning the star chromatic number of a graph (Q1362095) (← links)
- Some star extremal circulant graphs (Q1408873) (← links)
- Circular chromatic number and a generalization of the construction of Mycielski. (Q1417963) (← links)
- On the fractional chromatic number and the lexicographic product of graphs (Q1584257) (← links)
- The star chromatic numbers of some planar graphs derived from wheels (Q1601230) (← links)
- Coloring the vertices of a graph with measurable sets in a probability space (Q1765609) (← links)
- Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
- Circular chromatic numbers of some distance graphs (Q1773363) (← links)
- Circular chromatic number for iterated Mycielski graphs (Q1877680) (← links)
- The circular chromatic number of induced subgraphs (Q1880798) (← links)
- The circular chromatic index (Q1883257) (← links)
- Star-extremal graphs and the lexicographic product (Q1917490) (← links)
- On the bounds for the ultimate independence ratio of a graph (Q1923515) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← links)
- Signed planar graphs with given circular chromatic numbers (Q2166279) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Extending precolorings to circular colorings (Q2496199) (← links)
- Star chromatic numbers of graphs (Q2563519) (← links)
- Coloring of distance graphs with intervals as distance sets (Q2567207) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- An analogue of Hajós’ Theorem for the circular chromatic number (Q2723478) (← links)
- Projectivity and independent sets in powers of graphs (Q3150193) (← links)
- Coloring the Cartesian Sum of Graphs (Q3439356) (← links)
- Proof of a conjecture on fractional Ramsey numbers (Q3553231) (← links)
- Circular colouring and graph homomorphism (Q4243353) (← links)
- (Q4944681) (← links)
- The circular chromatic number of series-parallel graphs with large girth (Q4948748) (← links)
- (Q5708590) (← links)