Randomly H graphs

Gary Chartrand; Ortrud R. Oellermann; Sergio Ruiz

Mathematica Slovaca (1986)

  • Volume: 36, Issue: 2, page 129-136
  • ISSN: 0232-0525

How to cite

top

Chartrand, Gary, Oellermann, Ortrud R., and Ruiz, Sergio. "Randomly $H$ graphs." Mathematica Slovaca 36.2 (1986): 129-136. <http://eudml.org/doc/32098>.

@article{Chartrand1986,
author = {Chartrand, Gary, Oellermann, Ortrud R., Ruiz, Sergio},
journal = {Mathematica Slovaca},
keywords = {randomly H graphs},
language = {eng},
number = {2},
pages = {129-136},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Randomly $H$ graphs},
url = {http://eudml.org/doc/32098},
volume = {36},
year = {1986},
}

TY - JOUR
AU - Chartrand, Gary
AU - Oellermann, Ortrud R.
AU - Ruiz, Sergio
TI - Randomly $H$ graphs
JO - Mathematica Slovaca
PY - 1986
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 36
IS - 2
SP - 129
EP - 136
LA - eng
KW - randomly H graphs
UR - http://eudml.org/doc/32098
ER -

References

top
  1. BÄBLER F., Über eine spezielle Klasse Euleгscheг Graphen, Comment. Math. Helv. 27, 1953, 81-100. (1953) MR0056273
  2. BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L., Gгaphs V Digraphs, Wadsworth International, Belmont, CA, 1979. (1979) 
  3. CHARTRAND G., HKRONK H. V., Randomly traceable graphs, SIAM J. Appl. Math. 16, 1968, 696-700. (1968) MR0234852
  4. CHARTRAND G., KRONK H. V., LICK D. R., Randomly hamiltonian digraphs, Fund. Math. 65, 1969, 223-226. (1969) Zbl0181.27304MR0246788
  5. CHARTRAND G., LICK D. R., Randomly eulerian digraphs, Czech. Math. J. 21, 1971, 424-430. (1971) Zbl0221.05066MR0288052
  6. CHARTRAND G., WHITE A. T., Randomly traversable graphs, Elem. Math. 25, 1970, 101-107. (1970) Zbl0199.27401MR0285426
  7. DIRAC G. A., THOMASSEN C., Graphs in which every finite path is contained in a circuit, Math. Ann. 203, 1973, 65-75. (1973) Zbl0239.05129MR0335352
  8. ERICKSON D. B., Arbitrarily traceable graphs and digraphs, J. Combinatorial Theory Ser. B 19, 1975, 5-23. (1975) Zbl0278.05109MR0398898
  9. FINK J. F., Randomly antitraceable digraphs, J. Graph Theory 6, 1982, 481-488. (1982) Zbl0498.05036MR0679604
  10. FINK J. F., Randomly near-tranceable graphs, (Submitted for publication) 
  11. HARARY F., On arbitrarily traceable graphs and directed graphs, Scripta Math. 23, 1957, 37-41. (1957) MR0099041
  12. HARARY F., Graph Theory, Addison-Wesley, Reading, MA, 1969. (1969) Zbl0196.27202MR0256911
  13. ORE O., A problem regarding the tracing of graphs, Elem. Math. 6, 1951, 49-53. (1951) Zbl0043.38503MR0041418
  14. PARSONS T. D., Paths extendable to cycle, J. Graph Theory 2, 1978, 337-339. (1978) MR0505821
  15. SUMNER D. P., Randomly matchable graphs, J. Graph Theory 3, 1979, 183-186. (1979) Zbl0404.05053MR0530304
  16. THOMASSEN C., On randomly Hamiltonian graphs, Math. Ann. 200, 1973, 195-208. (1973) Zbl0233.05121MR0325456
  17. THOMASSEN C., Graphs in which every path is contained in a Hamiltonian path, J. Reine Angew. Math. 268/269, 1974, 271-282. (1974) MR0349484

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.