Pages that link to "Item:Q3487411"
From MaRDI portal
The following pages link to A note on the star chromatic number (Q3487411):
Displaying 50 items.
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- Extending precolourings of circular cliques (Q658016) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- On defining numbers of circular complete graphs (Q864158) (← links)
- An analogue of Dirac's theorem on circular super-critical graphs (Q875063) (← links)
- On minimally circular-imperfect graphs (Q932581) (← links)
- Density and power graphs in graph homomorphism problem (Q932664) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- Paths, cycles and circular colorings in digraphs (Q1019171) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- The circular chromatic number of hypergraphs (Q1045069) (← links)
- A generalization of the Erdős-Ko-Rado theorem (Q1045161) (← links)
- Inequalities with respect to graph homomorphism (Q1210578) (← links)
- Fractional multiples of graphs and the density of vertex-transitive graphs (Q1296389) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
- Independence ratios of graph powers (Q1322230) (← 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)
- Homomorphisms from sparse graphs with large girth. (Q1425115) (← 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)
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs (Q1711423) (← links)
- Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
- A revival of the girth conjecture (Q1880788) (← links)
- The circular chromatic number of induced subgraphs (Q1880798) (← links)
- The circular chromatic index (Q1883257) (← links)
- Chromatic invariants for finite graphs: Theme and polynomial variations (Q1899442) (← links)
- Star chromatic numbers of hypergraphs and partial Steiner triple systems (Q1903717) (← links)
- On the ultimate normalized chromatic difference sequence of a graph (Q1910556) (← links)
- Star-extremal graphs and the lexicographic product (Q1917490) (← links)
- On the bounds for the ultimate independence ratio of a graph (Q1923515) (← links)
- Asymptotic lower bounds on circular chromatic index of snarks (Q1953476) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← links)
- On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
- Signed planar graphs with given circular chromatic numbers (Q2166279) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Circular vertex arboricity (Q2275930) (← links)
- Compact cyclic edge-colorings of graphs (Q2427500) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- Minimal circular-imperfect graphs of large clique number and large independence number (Q2427550) (← links)
- On the theta number of powers of cycle graphs (Q2439827) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- Extending precolorings to circular colorings (Q2496199) (← links)
- Independence and coloring properties of direct products of some vertex-transitive graphs (Q2509308) (← links)
- Star chromatic numbers of graphs (Q2563519) (← links)
