The fractional chromatic number of mycielski's graphs
From MaRDI portal
Publication:4698090
DOI10.1002/jgt.3190190313zbMath0830.05027OpenAlexW2170803232MaRDI QIDQ4698090
James Propp, Daniel H. Ullman, Michael J. Larsen
Publication date: 14 May 1995
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190190313
Related Items
Fractional isomorphism of graphs, DOMINATION PARAMETERS IN MYCIELSKI GRAPHS, The fractional chromatic number of generalized cones over graphs, Connectivity of the generalised Mycielskian of digraphs, Independence number and packing coloring of generalized Mycielski graphs, Injective coloring of some subclasses of bipartite graphs and chordal graphs, No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles, On the complexity of injective colorings and its generalizations, Total chromatic number of generalized Mycielski graphs, Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs, The fractional chromatic number of Zykov products of graphs, On multichromatic numbers of widely colorable graphs, Edge-chromatic numbers of Mycielski graphs, Graph classes generated by Mycielskians, Some star extremal circulant graphs, Chromatic Gallai identities operating on Lovász number, Multicoloring and Mycielski construction, On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs, Triangle-free graphs whose independence number equals the degree, Fractional chromatic numbers of cones over graphs, Mycielski type constructions for hypergraphs associated with fractional colorings, Unnamed Item, The hub number, girth and Mycielski graphs, Several parameters of generalized Mycielskians, Hall ratio of the Mycielski graphs, Fractional dimension of partial orders, Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results, Unnamed Item, Revisiting a theorem by Folkman on graph colouring, On fractional cut covers, Cliques, holes and the vertex coloring polytope, Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces, Bounds for the boxicity of Mycielski graphs, Subcubic triangle-free graphs have fractional chromatic number at most 14/5, On the fractional chromatic number and the lexicographic product of graphs, Circular chromatic numbers of Mycielski's graphs, Graph imperfection. I, On strict strong coloring of graphs, The Mycielskian of a Graph, On the Circular Chromatic Number of Graph Powers, Fractional cocoloring of graphs
