Non-cover generalized Mycielski, Kneser, and Schrijver graphs

DOI10.1016/J.DISC.2007.08.082MaRDI QIDQ942096zbMATH OpenOpenAlexFDO

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

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 numbercover graphHasse diagramKneser graphMycielski graphpartially ordered setSchrijver graph

Mathematics Subject Classification ID

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

Recommendations

• When is the direct product of generalized Mycielskians a cover graph?
• Circular coloring and Mycielski construction
• Circular chromatic number and a generalization of the construction of Mycielski.
• Several parameters of generalized Mycielskians
• Circular chromatic numbers of the generalized Mycielskians of cycles

Cites work

• Acyclic orientations of complete bipartite graphs
• Circular chromatic number: A survey
• Circular chromatic numbers of the generalized Mycielskians of cycles
• Fractional chromatic numbers of cones over graphs
• scientific article; zbMATH DE number 3889587 (Why is no real title available?)
• scientific article; zbMATH DE number 3672329 (Why is no real title available?)
• scientific article; zbMATH DE number 811561 (Why is no real title available?)
• scientific article; zbMATH DE number 3411071 (Why is no real title available?)
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• On (k,d)-colorings and fractional nowhere-zero flows
• 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
• Sur le coloriage des graphs
• The number of dependent arcs in an acyclic orientation

Cited in

(3)

• A generalization of Kneser graphs
• Generalised Mycielski graphs and the Borsuk-Ulam theorem
• When is the direct product of generalized Mycielskians a cover graph?

This page was built for publication: Non-cover generalized Mycielski, Kneser, and Schrijver graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q942096)