On connected graphs containing exactly two points of the same degree

Ladislav Nebeský

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

  • Volume: 098, Issue: 3, page 305-306
  • ISSN: 0528-2195

How to cite

top

Nebeský, Ladislav. "On connected graphs containing exactly two points of the same degree." Časopis pro pěstování matematiky 098.3 (1973): 305-306. <http://eudml.org/doc/21165>.

@article{Nebeský1973,
author = {Nebeský, Ladislav},
journal = {Časopis pro pěstování matematiky},
language = {eng},
number = {3},
pages = {305-306},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On connected graphs containing exactly two points of the same degree},
url = {http://eudml.org/doc/21165},
volume = {098},
year = {1973},
}

TY - JOUR
AU - Nebeský, Ladislav
TI - On connected graphs containing exactly two points of the same degree
JO - Časopis pro pěstování matematiky
PY - 1973
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 098
IS - 3
SP - 305
EP - 306
LA - eng
UR - http://eudml.org/doc/21165
ER -

References

top
  1. M. Behzadand G. Chartrand, No graph is perfect, Amer. Math. Monthly 74(1967), 962-963. (1967) MR0220627
  2. E. Harary, Graph Theory, Addison-Wesley, Reading 1969. (1969) Zbl0196.27202MR0256911
  3. E. A. Nordhaus, J. W. Gaddum, On the complementary graphs, Amer. Math. Monthly 63 (1956), 175-177. (1956) MR0078685

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.