On a $1$-factor of the fourth power of a connected graph

@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 -