On a -factor of the fourth power of a connected graph
Časopis pro pěstování matematiky (1988)
- Volume: 113, Issue: 4, page 415-420
- ISSN: 0528-2195
Access Full Article
top
How to cite
topNebeský, Ladislav. "On a $1$-factor of the fourth power of a connected graph." Časopis pro pěstování matematiky 113.4 (1988): 415-420. <http://eudml.org/doc/21725>.
@article{Nebeský1988,
author = {Nebeský, Ladislav},
journal = {Časopis pro pěstování matematiky},
keywords = {perfect matching; triangle free subgraph; maximum degree; Hamilton cycle; 1-factor},
language = {eng},
number = {4},
pages = {415-420},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On a $1$-factor of the fourth power of a connected graph},
url = {http://eudml.org/doc/21725},
volume = {113},
year = {1988},
}
TY - JOUR
AU - Nebeský, Ladislav
TI - On a $1$-factor of the fourth power of a connected graph
JO - Časopis pro pěstování matematiky
PY - 1988
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 113
IS - 4
SP - 415
EP - 420
LA - eng
KW - perfect matching; triangle free subgraph; maximum degree; Hamilton cycle; 1-factor
UR - http://eudml.org/doc/21725
ER -
References
top- M. Behzad G. Chartrand L. Lesniak-Foster, Graphѕ & Digгaphѕ, Prindlе, Wеbеr & Sсhmidt, Boѕton 1979. (1979)
- F. Harary, Graph Thеoгy, Addiѕon-Wеѕlеy, Rеading, Мaѕѕ., 1969. (1969) MR0256911
- L. Nebeský, On the exiѕtеnсе of a 3-faсtor in thе fourth powег of a graph, Čaѕopiѕ pěѕt. mat. 105 (1980), 204-207. (1980)
- M. Sekanina, On an ordеring of thе ѕеt of vеrtiсеѕ of a сonnесtеd graph, Publ. Sсi. Univ. Brno 412 (1960), 137-142. (1960) MR0140095
- E. Wisztová, A hamiltonian сyсlе and a 1-faсtor in thе fouгth powеr of a graph, Čaѕopiѕ pěѕt. mat. 110 (1985), 403-412. (1985)
Citations in EuDML Documents
topNotesEmbed ?
topYou 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.