On H -closed graphs

Pavel Tomasta; Eliška Tomová

Czechoslovak Mathematical Journal (1988)

  • Volume: 38, Issue: 3, page 404-419
  • ISSN: 0011-4642

How to cite

top

Tomasta, Pavel, and Tomová, Eliška. "On $H$-closed graphs." Czechoslovak Mathematical Journal 38.3 (1988): 404-419. <http://eudml.org/doc/13715>.

@article{Tomasta1988,
author = {Tomasta, Pavel, Tomová, Eliška},
journal = {Czechoslovak Mathematical Journal},
keywords = {subgraph isomorphism; H-closed graphs},
language = {eng},
number = {3},
pages = {404-419},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On $H$-closed graphs},
url = {http://eudml.org/doc/13715},
volume = {38},
year = {1988},
}

TY - JOUR
AU - Tomasta, Pavel
AU - Tomová, Eliška
TI - On $H$-closed graphs
JO - Czechoslovak Mathematical Journal
PY - 1988
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 38
IS - 3
SP - 404
EP - 419
LA - eng
KW - subgraph isomorphism; H-closed graphs
UR - http://eudml.org/doc/13715
ER -

References

top
  1. G. Chartrand H. V. Kronk, 10.1137/0116056, SIAM J. Appl. Math. 16 (1968) 696-700. (1968) MR0234852DOI10.1137/0116056
  2. G. Chartrand H. V. Kronk D. R. Lick, 10.4064/fm-65-2-223-226, Fund. Math. 65 (1969) 223-226. (1969) MR0246788DOI10.4064/fm-65-2-223-226
  3. G. Chartrand D. R. Lick, Randomly eulerian digraphs, Czech. Math. J. 21 (1971) 424-430. (1971) MR0288052
  4. G. Chartrand О. R. Oellermann S. Ruiz, Randomly H -Graphs, To appear in Math. Slovaca. MR0849703
  5. G. A. Dirac C. Thomassen, 10.1007/BF01349245, Math. Ann. 203 (1973) 65-75. (1973) MR0335352DOI10.1007/BF01349245
  6. D. B. Erickson, 10.1016/0095-8956(75)90070-2, J. Combinatorial Theory Ser. В 19 (1975) 5-23. (1975) Zbl0278.05109MR0398898DOI10.1016/0095-8956(75)90070-2
  7. F. Harary, On arbitrarily traceable graphs and directed graphs, Scripta Math. 23 (1957) 37-51. (1957) MR0099041
  8. О. Ore, А problem regarding the tracing of graphs, Elem. Math. 6 (1951) 49-53. (1951) Zbl0043.38503MR0041418
  9. T. D. Parsons, 10.1002/jgt.3190020408, J. Graph Theory 2 (1978) 337-339. (1978) MR0505821DOI10.1002/jgt.3190020408
  10. J. Sheehan, 10.1016/0095-8956(73)90055-5, J. Combinatorial Theory 14 (1973) 125-131. (1973) Zbl0271.05125MR0316317DOI10.1016/0095-8956(73)90055-5
  11. J. Sheehan, 10.1016/0095-8956(72)90037-8, J. Combinatorial Theory 12 (1972) 226-244. (1972) DOI10.1016/0095-8956(72)90037-8
  12. D. P. Sumner, 10.1002/jgt.3190030209, J. Graph Theory 3 (1979) 183-186. (1979) Zbl0404.05053MR0530304DOI10.1002/jgt.3190030209

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.