Pure circuits in cube graphs

Bohdan Zelinka

Časopis pro pěstování matematiky (1983)

  • Volume: 108, Issue: 3, page 239-240
  • ISSN: 0528-2195

How to cite

top

Zelinka, Bohdan. "Pure circuits in cube graphs." Časopis pro pěstování matematiky 108.3 (1983): 239-240. <http://eudml.org/doc/21536>.

@article{Zelinka1983,
author = {Zelinka, Bohdan},
journal = {Časopis pro pěstování matematiky},
keywords = {n-dimensional cube; circuit; induced subgraph; maximum length},
language = {eng},
number = {3},
pages = {239-240},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Pure circuits in cube graphs},
url = {http://eudml.org/doc/21536},
volume = {108},
year = {1983},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Pure circuits in cube graphs
JO - Časopis pro pěstování matematiky
PY - 1983
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 108
IS - 3
SP - 239
EP - 240
LA - eng
KW - n-dimensional cube; circuit; induced subgraph; maximum length
UR - http://eudml.org/doc/21536
ER -

References

top
  1. A. Kotzig, Selected open problems in graph theory, In: Graph Theory and Related Topics, Academic Press, New York 1979. (1979) 

NotesEmbed ?

top

You must be logged in to post comments.