On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

DOI10.1007/978-3-642-02029-2_15zbMath1194.05130MaRDI QIDQ3655149

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

Publication date: 7 January 2010

Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_15

zbMATH Keywords

bandwidth; AT-free graphs; cocomparability graphs; intersection graphs; circular-arc graphs; cubicity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C75: Structural characterization of families of graphs

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)