Star chromatic number
From MaRDI portal
Publication:3807231
DOI10.1002/jgt.3190120411zbMath0658.05028OpenAlexW2130738665MaRDI QIDQ3807231
Publication date: 1988
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190120411
Related Items (only showing first 100 items - show all)
Unnamed Item ⋮ Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings ⋮ Fractional, Circular, and Defective Coloring of Series-Parallel Graphs ⋮ The circular chromatic number of series-parallel graphs with large girth ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Circular-imperfection of triangle-free graphs ⋮ Homomorphisms to small negative even cycles ⋮ On two questions about circular choosability ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ A note onn-tuple colourings and circular colourings of planar graphs with large odd girth ⋮ Circular choosability via combinatorial Nullstellensatz ⋮ On the Complexity of Digraph Colourings and Vertex Arboricity ⋮ Claw-free circular-perfect graphs ⋮ Circular Chromatic Indices of Regular Graphs ⋮ Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract ⋮ Circular colouring and graph homomorphism ⋮ On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Clique and chromatic number of circular-perfect graphs ⋮ Packing spanning trees in highly essentially connected graphs ⋮ Circular chromatic number for iterated Mycielski graphs ⋮ Integer round-up property for the chromatic number of some \(h\)-perfect graphs ⋮ A revival of the girth conjecture ⋮ The circular chromatic number of induced subgraphs ⋮ The circular chromatic index ⋮ Degrees and degree sequence ofk-edged-critical graphs ⋮ Circular colouring and algebraic no-homomorphism theorems ⋮ A dichotomy theorem for circular colouring reconfiguration ⋮ Circular coloring of graphs via linear programming and tabu search ⋮ Unnamed Item ⋮ First non-trivial upper bound on circular chromatic number of the plane ⋮ Star chromatic numbers of hypergraphs and partial Steiner triple systems ⋮ Some theorems concerning the star chromatic number of a graph ⋮ The circular chromatic index of graphs of high girth ⋮ On defining numbers of circular complete graphs ⋮ On the ultimate normalized chromatic difference sequence of a graph ⋮ Signed planar graphs with given circular chromatic numbers ⋮ Mixed hypergraphs and other coloring problems ⋮ Star-extremal graphs and the lexicographic product ⋮ An analogue of Dirac's theorem on circular super-critical graphs ⋮ The circular chromatic index of some Class 2 graphs ⋮ Computing clique and chromatic number of circular-perfect graphs in polynomial time ⋮ On the bounds for the ultimate independence ratio of a graph ⋮ Optimal colorings with rainbow paths ⋮ On \(J\)-colorability of certain derived graph classes ⋮ Circular coloring of planar digraphs ⋮ Resource-sharing systems and hypergraph colorings ⋮ Circular chromatic number of Kneser graphs ⋮ Circular total chromatic numbers of graphs ⋮ Compact cyclic edge-colorings of graphs ⋮ On the adaptable chromatic number of graphs ⋮ Minimal circular-imperfect graphs of large clique number and large independence number ⋮ Some star extremal circulant graphs ⋮ Dilation coefficient, plane-width, and resolution coefficient of graphs ⋮ Density of 5/2-critical graphs ⋮ Asymptotic lower bounds on circular chromatic index of snarks ⋮ Circular chromatic number and a generalization of the construction of Mycielski. ⋮ On the theta number of powers of cycle graphs ⋮ A survey of graph coloring - its types, methods and applications ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Arrangements, channel assignments, and associated polynomials ⋮ Homomorphisms from sparse graphs with large girth. ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ Independence number of products of Kneser graphs ⋮ On circular-perfect graphs: a survey ⋮ Concepts of signed graph coloring ⋮ On minimally circular-imperfect graphs ⋮ Density and power graphs in graph homomorphism problem ⋮ Circular chromatic numbers of distance graphs with distance sets missing multiples ⋮ \(T\)-colorings, divisibility and the circular chromatic number ⋮ An analogue of Hajós’ Theorem for the circular chromatic number ⋮ Shifts of the stable Kneser graphs and hom-idempotence ⋮ Upper bound on the circular chromatic number of the plane ⋮ On classes of minimal circular-imperfect graphs ⋮ Circular coloring and Mycielski construction ⋮ Resource-sharing system scheduling and circular chromatic number ⋮ Homomorphisms from sparse graphs to the Petersen graph ⋮ Circular chromatic numbers of some distance graphs ⋮ Several parameters of generalized Mycielskians ⋮ Brooks' theorem via the Alon-Tarsi theorem ⋮ Extending precolorings to circular colorings ⋮ K4-free graphs with no odd hole: Even pairs and the circular chromatic number ⋮ Independence and coloring properties of direct products of some vertex-transitive graphs ⋮ Computing the clique number of \(a\)-perfect graphs in polynomial time ⋮ Coloring graphs by translates in the circle ⋮ Circular chromatic number of signed graphs ⋮ Coloring the Cartesian sum of graphs ⋮ The complexity of nonrepetitive coloring ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers ⋮ The star dichromatic number ⋮ Triangle-free strongly circular-perfect graphs ⋮ Circular choosability is rational ⋮ The plane-width of graphs ⋮ A connection between circular colorings and periodic schedules ⋮ The circular chromatic numbers of signed series-parallel graphs ⋮ Interference patterns in bijective colorings of 2-regular graphs ⋮ On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs ⋮ Star chromatic numbers of graphs ⋮ On colorings of graph powers
This page was built for publication: Star chromatic number
