Bounds for the boxicity of Mycielski graphs

zbMath1384.05116arXiv1308.2368MaRDI QIDQ4634991

Akira Kamibeppu

Publication date: 13 April 2018

Full work available at URL: https://arxiv.org/abs/1308.2368

zbMATH Keywords

chromatic numberMycielski graphboxicityedge clique cover numbercointerval graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Boxicity of line graphs
• Computing the boxicity of a graph by covering its complement by cointerval graphs
• Chordal bipartite graphs with high boxicity
• Cubicity, boxicity, and vertex cover
• Interval representations of planar graphs
• A characterization of Robert's inequality for boxicity
• Boxicity and cubicity of product graphs
• Several parameters of generalized Mycielskians
• Boxicity and treewidth
• Representation of a finite graph by a set of intervals on the real line
• The fractional chromatic number of mycielski's graphs
• Sur le coloriage des graphs

This page was built for publication: Bounds for the boxicity of Mycielski graphs