Filters
Hamiltonian Cycles in the Square of a Graph with Block Graph Homeomorphic to a Star
We present necessary and sufficient conditions for hamiltonicity of the square of a connected graph whose block graph is homeomorphic to a star. We show that under certain conditions the square of the graph
BA - Obecná matematika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Hamiltonian Cycles in the Square of a Graph
We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditi...
BA - Obecná matematika
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
Hamiltonian Cycles in the Square of a Graph
We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditi...
BA - Obecná matematika
- 2011 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Strongly regular square of distance regular graphs
A necessary condition for G to have the square strongly regular is found and the problem of the construction such graphs G is solved....
BA - Obecná matematika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Coloring squares of planar graphs with girth six
We show that the squares of planar graphs of girth six or more with sufficiently large maximum degree D are (D+2)-colorable.
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Metrically regular square of metrically regular bipartite graphs of diameter D = 7
square. The results deal with the graphs of the diameter D < 7.The present paper deals with the spectra of powers of metrically regular graphs. We prove that there is only twoo tables of the parameters of an association sc...
Pure mathematics
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Trestles in the squares of graphs
We show that the square of every connected S(K_{1,4})-free graph satisfying a matching condition has a 2-connected spanning subgraph of maximum degree at most 3. Furthermore, we characterise trees whose square has a 2-conne...
Pure mathematics
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Hamiltonian Properties in the Square of a Graph and Packing Coloring of a Graph
of a connected even factor in the square of a graph. New results are marked with an asterisk edges) graphs. The thesis consists of two main parts: powers of graphs and packing coloring of graphs. One of t...
BA - Obecná matematika
- 2011 •
- O
Rok uplatnění
O - Ostatní výsledky
Z. Wu, X. Zhang, X. Zhou : Hamiltonicity, neighborhood intersections and the partially square graphs
A review of article Z. Wu, X. Zhang, X. Zhou : Hamiltonicity, neighborhood intersections and the partially square graphs, Discrete Math. 242, No.1-3, 245-254 (2002)....
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Connected even factors in the square of essentially 2-edge-connected graph
An essentially k-edge connected graph G is a connected graph such that deleting we prove that if an essentially 2-edge-connected graph G satisfies that for any 2 to one of them, then the square G^2 has a connected ...
Pure mathematics
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
- 1 - 10 out of 15 277