VOLUME 8 2003 NUMBER 4

Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs
A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro
Pages 675–681





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2003-675,
  author  = {A. N. M. Salman and Hajo Broersma and Edy Tri Baskoro},
  title   = {Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {8},
  number  = {4},
  pages   = {675--681},
  year    = {2003},
  url     = {https://doi.org/10.25596/jalc-2003-675},
  doi     = {10.25596/jalc-2003-675}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: alphabet graph, grid graph, Hamilton cycle, spanning 2-connected subgraph
DOI: 10.25596/jalc-2003-675