Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Shailesh K. Tipnis"'
Publikováno v:
Discrete Mathematics Letters, Vol 6, Pp 32-37 (2021)
Externí odkaz:
https://doaj.org/article/0c85ff64c95840cab3ee86e12992ce13
Publikováno v:
Discrete Mathematics. 325:47-51
It is known that P 4 , the path with 3 edges, decomposes every 6-regular simple graph. It is also known that P 4 decomposes the multigraph obtained by doubling each edge of a cubic graph. We show that P 4 decomposes every 6-regular multigraph with ed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52971b8ec57946fea3f6bdd60f20dec3
https://doi.org/10.1016/j.disc.2014.02.011
https://doi.org/10.1016/j.disc.2014.02.011
Autor:
Timothy Morris, Arthur H. Busch, Michael S. Jacobson, Michael J. Plantholt, Shailesh K. Tipnis
Publikováno v:
Graphs and Combinatorics. 29:359-364
Let D be a directed graph of order n. An anti-directed (hamiltonian) cycle H in D is a (hamiltonian) cycle in the graph underlying D such that no pair of consecutive arcs in H form a directed path in D. In this paper we give sufficient conditions for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b0ff77b1f514997a2efc8af8c9497c0
https://doi.org/10.1007/s00373-011-1116-0
https://doi.org/10.1007/s00373-011-1116-0
Publikováno v:
Discrete Mathematics & Theoretical Computer Science. 17
Let G denote a multigraph with edge set E(G), let µ(G) denote the maximum edge multiplicity in G, and let Pk denote the path on k vertices. Heinrich et al.(1999) showed that P4 decomposes a connected 4-regular graph G if and only if |E(G)| is divisi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::962571f300ffd12870bcb1e84939c9da
https://doi.org/10.46298/dmtcs.2128
https://doi.org/10.46298/dmtcs.2128
Publikováno v:
Journal of Graph Theory. 19:93-105
A regular multigraph with maximum multiplicity r and degree rs cannot always be factored into r s-regular simple graphs. It is shown, however, that under general conditions a similar factorization can be achieved if we first allow the addition or del
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::998728a4e1a846119ad70bf9aff7d95a
https://doi.org/10.1002/jgt.3190190110
https://doi.org/10.1002/jgt.3190190110
Publikováno v:
IndraStra Global.
Let D be a directed graph with vertex set V. arc set A, and order n. The graph underlying D is the graph obtained from D by replacing each arc (u. v) is an element of A by an undirected edge {u. v} land then replacing each double edge by a single edg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c615b7a662d134304ddcae9d02b9c9bf
https://igi.indrastra.com/items/show/53932
https://igi.indrastra.com/items/show/53932
Publikováno v:
The Electronic Journal of Combinatorics. 16
Let $D$ be a directed graph of order $n$. An anti-directed Hamilton cycle $H$ in $D$ is a Hamilton cycle in the graph underlying $D$ such that no pair of consecutive arcs in $H$ form a directed path in $D$. We prove that if $D$ is a directed graph wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf7b7b2e170af06a107bfd39c5fbb204
https://doi.org/10.37236/204
https://doi.org/10.37236/204
Publikováno v:
Journal of the London Mathematical Society. :393-400
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2485a03c75312fb765b9b9fc7f64e12
https://doi.org/10.1112/jlms/s2-44.3.393
https://doi.org/10.1112/jlms/s2-44.3.393
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 1, Pp 73-79 (2015)
A double-star is a tree with exactly two vertices of degree greater than 1. If T is a double-star where the two vertices of degree greater than one have degrees k1+1 and k2+1, then T is denoted by Sk1,k2 . In this note, we show that every double-star
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07d372f6f66a40c38ee4709de82b597d
https://doi.org/10.7151/dmgt.1779
https://doi.org/10.7151/dmgt.1779
Publikováno v:
The Electronic Journal of Combinatorics. 8
Plantholt and Tipnis (1991) proved that for any even integer $r$, a regular multigraph $G$ with even order $n$, multiplicity $\mu(G) \leq r$ and degree high relative to $n$ and $r$ is 1-factorable. Here we extend this result to include the case when
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69916834bb332be0ffb442e0a81c4cce
https://doi.org/10.37236/1585
https://doi.org/10.37236/1585