Non-cover generalized Mycielski, Kneser, and Schrijver graphs

DOI10.1016/j.disc.2007.08.082zbMath1154.05034OpenAlexW2065065661MaRDI QIDQ942096

Ko-Wei Lih, Li-Da Tong, Chen-Ying Lin

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.082

zbMATH Keywords

circular chromatic numberpartially ordered setMycielski graphHasse diagramKneser graphcover graphSchrijver graph

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• On graphs that can be oriented as diagrams of ordered sets
• On reorienting graphs by pushing down maximal vertices
• On the complexity of diagram testing
• The number of dependent arcs in an acyclic orientation
• Acyclic orientations of complete bipartite graphs
• Fractional chromatic numbers of cones over graphs
• On (k,d)-colorings and fractional nowhere-zero flows
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• Sur le coloriage des graphs
• Circular chromatic number: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item