Sphericity, cubicity, and edge clique covers of graphs
From MaRDI portal
Publication:2495913
DOI10.1016/j.dam.2006.01.004zbMath1098.05068OpenAlexW2066466468WikidataQ86244475 ScholiaQ86244475MaRDI QIDQ2495913
Publication date: 30 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.01.004
Related Items
On the Cubicity of Interval Graphs, Cubicity and bandwidth, On the cubicity of bipartite graphs, Cubicity of interval graphs and the claw number, Cubicity, degeneracy, and crossing number, Cubicity, boxicity, and vertex cover, On the Cubicity of AT-Free Graphs and Circular-Arc Graphs, On the cubicity of interval graphs, Cliques and clique covers in fuzzy graphs1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding the n-cube in lower dimensions
- Space graphs and sphericity
- Applications of edge coverings by cliques
- On the sphericity and cubicity of graphs
- On the sphericity for the join of many graphs
- On the sphericity of the graphs of semiregular polyhedra
- Sphericity exceeds cubicity for almost all complete bipartite graphs
- Embedding of trees in Euclidean spaces
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- Unit disk graphs
- Unit disk graph recognition is NP-hard
- Embeddings of graphs in Euclidean spaces
- Geometrical embeddings of graphs
- The Representation of a Graph by Set Intersections
- Sphere-of-influence graphs using the sup-norm
- Representing graphs by disks and balls (a survey of recognition-complexity results)
