Previous |  Up |  Next


locally regular graph; regular graph
A graph $G$ is called locally $s$-regular if the neighbourhood of each vertex of $G$ induces a subgraph of $G$ which is regular of degree $s$. We study graphs which are locally $s$-regular and simultaneously regular of degree $r$.
[1] Theory of Graphs and its Applications. Proc. Symp. Smolenice, June 1963, Academia, Praha, 1964.
[2] G. Chartrand R. J. Gould A. D. Polimeni: A note on locally connected and hamiltonian-connected graphs. Israel Math. J. 33 (1979), 5-8. DOI 10.1007/BF02760528 | MR 0571579
[3] D. Fronček: Locally linear graphs. Math. Slovaca 39 (1989), 3-6. MR 1016323
[4] D. J. Oberly D. P. Sumner: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian. J. Graph Theory 3 (1979), 351-356. DOI 10.1002/jgt.3190030405 | MR 0549691
[5] J. Sedláček: Local properties of graphs. Časopis Pěst. Mat. 106 (1981), 290-298. MR 0629727
Partner of
EuDML logo