@article{RSMUP_2014__132__75_0, author = {Jumani, Ali Dino and Zamfirescu, Carol T. and Zamfirescu, Tudor I.}, title = {Lattice graphs with non-concurrent longest cycles}, journal = {Rendiconti del Seminario Matematico della Universit\`a di Padova}, pages = {75--82}, publisher = {Seminario Matematico of the University of Padua}, volume = {132}, year = {2014}, mrnumber = {3276827}, zbl = {06379717}, language = {en}, url = {http://archive.numdam.org/item/RSMUP_2014__132__75_0/} }
TY - JOUR AU - Jumani, Ali Dino AU - Zamfirescu, Carol T. AU - Zamfirescu, Tudor I. TI - Lattice graphs with non-concurrent longest cycles JO - Rendiconti del Seminario Matematico della Università di Padova PY - 2014 SP - 75 EP - 82 VL - 132 PB - Seminario Matematico of the University of Padua UR - http://archive.numdam.org/item/RSMUP_2014__132__75_0/ LA - en ID - RSMUP_2014__132__75_0 ER -
%0 Journal Article %A Jumani, Ali Dino %A Zamfirescu, Carol T. %A Zamfirescu, Tudor I. %T Lattice graphs with non-concurrent longest cycles %J Rendiconti del Seminario Matematico della Università di Padova %D 2014 %P 75-82 %V 132 %I Seminario Matematico of the University of Padua %U http://archive.numdam.org/item/RSMUP_2014__132__75_0/ %G en %F RSMUP_2014__132__75_0
Jumani, Ali Dino; Zamfirescu, Carol T.; Zamfirescu, Tudor I. Lattice graphs with non-concurrent longest cycles. Rendiconti del Seminario Matematico della Università di Padova, Volume 132 (2014), pp. 75-82. http://archive.numdam.org/item/RSMUP_2014__132__75_0/
[1] Lattice graphs with Gallai's property, Bull. Math. Soc. Sci. Math. Roumanie, 56 (2013), pp. 65–71. | MR | Zbl
- ,[2] On some super fault-tolerant Hamiltonian graphs, Appl. Math. Comput., 148 (2004), pp. 729–741. | MR | Zbl
- - - ,[3] Problem 4, in: Theory of Graphs Proc. Tihany 1966 (eds.: P. Erdös & G. Katona), Academic Press, New York, 1968, p. 362. | MR
,[4] A Graph Model for Fault-Tolerant Computing Systems, IEEE Trans. Comput., 25 (1976), pp. 875–884. | MR | Zbl
,[5] On the Construction of Combined -Fault-Tolerant Hamiltonian Graphs, Networks, 37 (2001), pp. 165–170. | MR | Zbl
- - ,[6] A Memoir on the Theory of Mathematical Form, Phil. Trans. Roy. Soc. Lond., 177 (1886), pp. 170.
,[7] Longest cycles in grid graphs, Studia Sci. Math. Hung., 36 (2000), pp. 201–230. | MR | Zbl
,[8] Intersections of longest cycles in grid graphs, J. Graph Theory, 25 (1997), pp. 37–52. | MR | Zbl
- - ,[9] Planar lattice graphs with Gallai's property, Graphs Combin., 29 (2013), pp. 1523–1529. | MR | Zbl
- - ,[10] Fault-hamiltonicity of hypercube-like interconnection networks, Proc. of IEEE International Parallel and Distributed Processing Symposium IPDPS 2005, Denver, Apr. 2005.
- - ,[11] Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements, Theoret. Comput. Sci., 377 (2007), pp. 170–180. | MR | Zbl
- - ,[12] Sur le théorème de Tait, L'Intermdiaire des Mathématiciens, 5 (1898), pp. 225–227.
,[13] Intersecting longest paths and longest cycles: A survey, Electron. J. Graph Theory Appl., 1 (2013), pp. 56–76. | MR | Zbl
- - ,[14] Fault-tolerant designs in triangular lattice networks, submitted.
- ,[15] Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen, J. Combin. Theory, 6 (1969), pp. 16. | MR | Zbl
,[16] Fault-tolerant graphs for tori, Networks, 32 (1998), pp. 181–188. | MR | Zbl
- ,[17] A two-connected planar graph without concurrent longest paths, J. Combin. Theory, Ser. B, 13 (1972), pp. 116–121. | MR | Zbl
,[18] On longest paths and circuits in graphs, Math. Scand., 38 (1976), pp. 211–239. | MR | Zbl
,[19] Intersecting longest paths or cycles: a short survey, Analele Univ. Craiova, Ser. Mat.-Inf., 28 (2001), pp. 19. | MR | Zbl
,