Pages that link to "Item:Q5931460"

The following pages link to Circular chromatic number: A survey (Q5931460):

Displaying 50 items.

• Minimal circular-imperfect graphs of large clique number and large independence number (Q2427550) (← links)
• \(k\)-regular graphs with the circular chromatic index close to \(k\) (Q2436828) (← links)
• Circular \(L(j,k)\)-labeling number of direct product of path and cycle (Q2444141) (← links)
• Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
• Colorful subgraphs in Kneser-like graphs (Q2461775) (← links)
• The circular chromatic index of Goldberg snarks (Q2463910) (← links)
• On classes of minimal circular-imperfect graphs (Q2482095) (← links)
• Several parameters of generalized Mycielskians (Q2495898) (← links)
• Extending precolorings to circular colorings (Q2496199) (← links)
• The chromatic number of random Cayley graphs (Q2509709) (← links)
• Coloring of distance graphs with intervals as distance sets (Q2567207) (← links)
• Multiplicative graphs and semi-lattice endomorphisms in the category of graphs (Q2573651) (← links)
• Minimally circular-imperfect graphs with a major vertex (Q2581632) (← links)
• On the circular altitude of graphs (Q2657876) (← links)
• Maximal density of sets with missing differences and various coloring parameters of distance graphs (Q2663373) (← links)
• An analogue of Hajós' theorem for the circular chromatic number (Q2723478) (← links)
• On equitable coloring of central graphs and total graphs (Q2839223) (← links)
• Properties of an approximability-related parameter on circular complete graphs (Q2840526) (← links)
• On the circular chromatic number of graph powers (Q2874089) (← links)
• Extensions of Fractional Precolorings Show Discontinuous Behavior (Q2930044) (← links)
• Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ (Q2946061) (← links)
• A survey of graph coloring - its types, methods and applications (Q2978431) (← links)
• Circular consecutive choosability of k-choosable graphs (Q3018072) (← links)
• K4-free graphs with no odd hole: Even pairs and the circular chromatic number (Q3061190) (← links)
• Short proofs for two theorems of Chien, Hell and Zhu (Q3067065) (← links)
• Snarks with given real flow numbers (Q3096956) (← links)
• The plane-width of graphs (Q3096959) (← links)
• Short cycle covers of graphs and nowhere-zero flows (Q3106270) (← links)
• Circular flows of nearly Eulerian graphs and vertex-splitting (Q3150192) (← links)
• Convex-round graphs are circular-perfect (Q3150195) (← links)
• Cyclic 4-Colorings of Graphs on Surfaces (Q3188662) (← links)
• THE GRAPH-BIN PACKING PROBLEM (Q3224960) (← links)
• (Q3305219) (← links)
• Coloring the Cartesian Sum of Graphs (Q3439356) (← links)
• Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract (Q3439626) (← links)
• The circular chromatic numbers of planar digraphs (Q3445499) (← links)
• Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
• Fractional, Circular, and Defective Coloring of Series-Parallel Graphs (Q3466361) (← links)
• A note on the star chromatic number (Q3487411) (← links)
• Circular-imperfection of triangle-free graphs (Q3503467) (← links)
• On two questions about circular choosability (Q3522852) (← links)
• Real flow number and the cycle rank of a graph (Q3528156) (← links)
• Multi-coloring the Mycielskian of graphs (Q3553236) (← links)
• Circular chromatic index of type 1 Blanuša snarks (Q3605142) (← links)
• Circular choosability via combinatorial Nullstellensatz (Q3605148) (← links)
• (Q3980548) (← links)
• The circular chromatic number of the Mycielskian ofGdk (Q4265588) (← links)
• Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
• The circular altitude of a graph (Q4622623) (← links)
• The round-up property of the fractional chromatic number for proper circular arc graphs (Q4948754) (← links)