Star chromatic number

From MaRDI portal
Publication:3807231

DOI10.1002/jgt.3190120411zbMath0658.05028OpenAlexW2130738665MaRDI QIDQ3807231

Andrew Vince

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)

On the odd girth and the circular chromatic number of generalized Petersen graphsClique and chromatic number of circular-perfect graphsPacking spanning trees in highly essentially connected graphsCircular chromatic number for iterated Mycielski graphsInteger round-up property for the chromatic number of some \(h\)-perfect graphsA revival of the girth conjectureThe circular chromatic number of induced subgraphsThe circular chromatic indexDegrees and degree sequence ofk-edged-critical graphsCircular colouring and algebraic no-homomorphism theoremsA dichotomy theorem for circular colouring reconfigurationCircular coloring of graphs via linear programming and tabu searchUnnamed ItemFirst non-trivial upper bound on circular chromatic number of the planeStar chromatic numbers of hypergraphs and partial Steiner triple systemsSome theorems concerning the star chromatic number of a graphThe circular chromatic index of graphs of high girthOn defining numbers of circular complete graphsOn the ultimate normalized chromatic difference sequence of a graphSigned planar graphs with given circular chromatic numbersMixed hypergraphs and other coloring problemsStar-extremal graphs and the lexicographic productAn analogue of Dirac's theorem on circular super-critical graphsThe circular chromatic index of some Class 2 graphsComputing clique and chromatic number of circular-perfect graphs in polynomial timeOn the bounds for the ultimate independence ratio of a graphOptimal colorings with rainbow pathsOn \(J\)-colorability of certain derived graph classesCircular coloring of planar digraphsResource-sharing systems and hypergraph coloringsCircular chromatic number of Kneser graphsCircular total chromatic numbers of graphsCompact cyclic edge-colorings of graphsOn the adaptable chromatic number of graphsMinimal circular-imperfect graphs of large clique number and large independence numberSome star extremal circulant graphsDilation coefficient, plane-width, and resolution coefficient of graphsDensity of 5/2-critical graphsAsymptotic lower bounds on circular chromatic index of snarksCircular chromatic number and a generalization of the construction of Mycielski.On the theta number of powers of cycle graphsA survey of graph coloring - its types, methods and applicationsRandomly colouring graphs (a combinatorial view)Arrangements, channel assignments, and associated polynomialsHomomorphisms from sparse graphs with large girth.Nowhere-zero 3-flows and modulo \(k\)-orientationsIndependence number of products of Kneser graphsOn circular-perfect graphs: a surveyConcepts of signed graph coloringOn minimally circular-imperfect graphsDensity and power graphs in graph homomorphism problemCircular chromatic numbers of distance graphs with distance sets missing multiples\(T\)-colorings, divisibility and the circular chromatic numberAn analogue of Hajós’ Theorem for the circular chromatic numberShifts of the stable Kneser graphs and hom-idempotenceUpper bound on the circular chromatic number of the planeOn classes of minimal circular-imperfect graphsCircular coloring and Mycielski constructionResource-sharing system scheduling and circular chromatic numberHomomorphisms from sparse graphs to the Petersen graphCircular chromatic numbers of some distance graphsSeveral parameters of generalized MycielskiansBrooks' theorem via the Alon-Tarsi theoremExtending precolorings to circular coloringsK4-free graphs with no odd hole: Even pairs and the circular chromatic numberIndependence and coloring properties of direct products of some vertex-transitive graphsComputing the clique number of \(a\)-perfect graphs in polynomial timeColoring graphs by translates in the circleCircular chromatic number of signed graphsColoring the Cartesian sum of graphsThe complexity of nonrepetitive coloringOn \(t\)-relaxed 2-distant circular coloring of graphsNordhaus-Gaddum inequalities for the fractional and circular chromatic numbersThe star dichromatic numberTriangle-free strongly circular-perfect graphsCircular choosability is rationalThe plane-width of graphsA connection between circular colorings and periodic schedulesThe circular chromatic numbers of signed series-parallel graphsInterference patterns in bijective colorings of 2-regular graphsOn the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphsStar chromatic numbers of graphsOn colorings of graph powersCircular game chromatic number of graphsThe circular chromatic number of hypergraphsColoring of distance graphs with intervals as distance setsOn the fractional chromatic number and the lexicographic product of graphsCircular chromatic numbers of Mycielski's graphsColouring non-even digraphsCircular chromatic indices of even degree regular graphsDistance graphs and \(T\)-coloringPlanar graphs with circular chromatic numbers between 3 and 4Minimally circular-imperfect graphs with a major vertexOn strongly circular-perfectnessThe star chromatic numbers of some planar graphs derived from wheelsCircular list colorings of some graphsCircular flows of nearly Eulerian graphs and vertex-splittingConvex-round graphs are circular-perfectEdge coloring of the signed generalized Petersen graphStar chromatic number of triangle-free planar graphs




This page was built for publication: Star chromatic number