Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Pouria Salehi"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 2, Pp 103-106 (2016)
This note introduces the vertex proper connection number of a graph and provides a relationship to the chromatic number of minimally connected subgraphs. Also a notion of total proper connection is introduced and a question is asked about a possible
Externí odkaz:
https://doaj.org/article/dd4d7664deb24dedbcae558c941b5018
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 3, Iss 1, Pp 50-55 (2015)
Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially
Externí odkaz:
https://doaj.org/article/3a87e6b08ad943f6976c6bed8ee877e9
Publikováno v:
Theory and Applications of Graphs, Vol 2, Iss 1 (2015)
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian cycle. We prove that most claw-free Hamiltonian graphs with minimum degree at least 3 have a second Hamiltonian cycle a
Externí odkaz:
https://doaj.org/article/8af96b5d9ce0452484fc2cc250fa8ca2
Publikováno v:
Theory and Applications of Graphs, Vol 1, Iss 1 (2014)
In this note, we provide a sharp upper bound on the rainbow connection number of tournaments of diameter $2$. For a tournament $T$ of diameter $2$, we show $2 \leq \overrightarrow{rc}(T) \leq 3$. Furthermore, we provide a general upper bound on the r
Externí odkaz:
https://doaj.org/article/f8022616bae1409481df729e292a3728
The \emph{prism} over a graph $G$ is the product $G \Box K_2$, i.e., the graph obtained by taking two copies of $G$ and adding a perfect matching joining the two copies of each vertex by an edge. The graph $G$ is called \emph{prism-hamiltonian} if it
Externí odkaz:
http://arxiv.org/abs/1901.01959
The prism over a graph $G$ is the cartesian product $G \Box K_2$. It is known that the property of having a Hamiltonian prism (prism-Hamiltonicity) is stronger than that of having a $2$-walk (spanning closed walk using every vertex at most twice) and
Externí odkaz:
http://arxiv.org/abs/1812.02894
We derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the number of segments. We consider sets of segments whose underlying planar gr
Externí odkaz:
http://arxiv.org/abs/1808.07176
Gallai-colorings are edge-colored complete graphs in which there are no rainbow triangles. Within such colored complete graphs, we consider Ramsey-type questions, looking for specified monochromatic graphs. In this work, we consider monochromatic bip
Externí odkaz:
http://arxiv.org/abs/1710.10455
Publikováno v:
In Discrete Applied Mathematics 30 September 2020 284:201-206
In 2000, Enomoto and Ota conjectured that if a graph $G$ satisfies $\sigma_{2}(G) \geq n + k - 1$, then for any set of $k$ vertices $v_{1}, \dots, v_{k}$ and for any positive integers $n_{1}, \dots, n_{k}$ with $\sum n_{i} = |G|$, there exists a part
Externí odkaz:
http://arxiv.org/abs/1408.0408