Author:
Sunil Chandran L.,Francis Mathew C.,Sivadasan Naveen
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Boxicity and treewidth;Sunil Chandran;J. Combin. Theory Ser. B,2007
2. M.B. Cozzens, Higher and multidimensional analogues of interval graphs, PhD thesis, Rutgers University, New Brunswick, NJ, 1981
3. Computing the boxicity of a graph by covering its complement by cointerval graphs;Cozzens;Discrete Appl. Math.,1983
4. A special planar satisfiability problem and a consequence of its NP-completeness;Kratochvil;Discrete Appl. Math.,1994
5. On the boxicity and cubicity of a graph;Roberts,1969
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A note on lower bounds for boxicity of graphs;Electronic Journal of Graph Theory and Applications;2024-04-20
2. On the boxicity of Kneser graphs and complements of line graphs;Discrete Mathematics;2023-05
3. Local boxicity and maximum degree;Discrete Mathematics;2022-12
4. Local boxicity;European Journal of Combinatorics;2022-05
5. Almost Optimal Inapproximability of Multidimensional Packing Problems;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02