On Dispersability of Some Circulant Graphs
Journal of Graph Algorithms and Applications, Tome 28 (2024) no. 1, pp. 225-241.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

The matching book thickness of a graph is the least number of pages in a book embedding such that each page is a matching. A graph is dispersable if its matching book thickness equals its maximum degree. Minimum page matching book embeddings are given for bipartite and for most non-bipartite circulants contained in the (Harary) cube of a cycle and for various higher-powers.
DOI : 10.7155/jgaa.v28i1.2941
Keywords: book thickness, dispersability, circulant graphs

Paul C. Kainen 1 ; Samuel Joslin 1 ; Shannon Overbay 2

1 Georgetown University
2 Gonzaga University
@article{JGAA_2024_28_1_a8,
     author = {Paul C. Kainen and Samuel Joslin and Shannon Overbay},
     title = {On {Dispersability} of {Some} {Circulant} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {225--241},
     publisher = {mathdoc},
     volume = {28},
     number = {1},
     year = {2024},
     doi = {10.7155/jgaa.v28i1.2941},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.v28i1.2941/}
}
TY  - JOUR
AU  - Paul C. Kainen
AU  - Samuel Joslin
AU  - Shannon Overbay
TI  - On Dispersability of Some Circulant Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2024
SP  - 225
EP  - 241
VL  - 28
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.v28i1.2941/
DO  - 10.7155/jgaa.v28i1.2941
LA  - en
ID  - JGAA_2024_28_1_a8
ER  - 
%0 Journal Article
%A Paul C. Kainen
%A Samuel Joslin
%A Shannon Overbay
%T On Dispersability of Some Circulant Graphs
%J Journal of Graph Algorithms and Applications
%D 2024
%P 225-241
%V 28
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.v28i1.2941/
%R 10.7155/jgaa.v28i1.2941
%G en
%F JGAA_2024_28_1_a8
Paul C. Kainen; Samuel Joslin; Shannon Overbay. On Dispersability of Some Circulant Graphs. Journal of Graph Algorithms and Applications, Tome 28 (2024) no. 1, pp. 225-241. doi : 10.7155/jgaa.v28i1.2941. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.v28i1.2941/

Cité par Sources :