Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Karen Seyffarth"'
Autor:
Kira Adaricheva, Heather Smith Blake, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Karen Seyffarth
The dominating graph of a graph $H$ has as its vertices all dominating sets of $H$, with an edge between two dominating sets if one can be obtained from the other by the addition or deletion of a single vertex of $H$. In this paper we prove that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2c9376c1ed16209dab75f120b07ac0e
Autor:
Kira Adaricheva, Chassidy Bozeman, Margaret-Ellen Messinger, Ruth Haas, Nancy E. Clarke, Karen Seyffarth, Heather C. Smith
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783030779825
The dominating graph of a graph G has as its vertices all dominating sets of G, with an edge between two dominating sets if one can be obtained from the other by adding or deleting a single vertex of G. This is an example of a reconfiguration graph.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0c07e3c5c684c7cf6b96ffd9571cbd6
https://doi.org/10.1007/978-3-030-77983-2_6
https://doi.org/10.1007/978-3-030-77983-2_6
Publikováno v:
Discrete Mathematics. 341:2431-2441
The distinguishing chromatic number of a graph, G , is the minimum number of colours required to properly colour the vertices of G so that the only automorphism of G that preserves colours is the identity. There are many classes of graphs for which t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8dbecdb1ba752d21419d9cb0c4d93fbb
https://doi.org/10.1016/j.disc.2018.05.016
https://doi.org/10.1016/j.disc.2018.05.016
Autor:
T. K. Rapke, Karen Seyffarth
Publikováno v:
Discrete Mathematics. 341:1-19
One way of defining an oriented colouring of a directed graph G → is as a homomorphism from G → to a target directed graph H → , and an injective oriented colouring of G → can be defined as a homomorphism from G → to a target directed graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91af5964f3df9a91a40ebe3c54ba8f2c
https://doi.org/10.1016/j.disc.2017.06.006
https://doi.org/10.1016/j.disc.2017.06.006
Autor:
Ruth Haas, Karen Seyffarth
Publikováno v:
Discrete Mathematics. 340:1802-1817
Let G be a graph and let k be a positive integer. The k -dominating graph of G , denoted by D k ( G ) , has vertices corresponding to the dominating sets of G having cardinality at most k ; two vertices of D k ( G ) are adjacent if and only if the do
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9df6fe8916d39557aebf65bbf896d36e
https://doi.org/10.1016/j.disc.2017.03.007
https://doi.org/10.1016/j.disc.2017.03.007
Autor:
Michael S. Cavers, Karen Seyffarth
Publikováno v:
Ars mathematica contemporanea
Let ?$H$? be a graph and let ?$k \geq \chi (H)$? be an integer. The ?$k$?-colouring graph of ?$H$?, denoted ?$G_k(H)$?, is the graph whose vertex set consists of all proper ?$k$?-vertex-colourings (or simply ?$k$?-colourings) of ?$H$? using colours ?
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d077aa9f94dec699d0c5bbf7d303e598
http://www.dlib.si/details/URN:NBN:SI:doc-MTYTYNX7
http://www.dlib.si/details/URN:NBN:SI:doc-MTYTYNX7
Publikováno v:
Kyungpook mathematical journal. 56:647-655
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f13fd10e63fd6f0593ea036900f45b6
https://doi.org/10.5666/kmj.2016.56.3.647
https://doi.org/10.5666/kmj.2016.56.3.647
Autor:
Ruth Haas, Karen Seyffarth
Publikováno v:
Graphs and Combinatorics. 30:609-617
Given a graph $G$, the $k$-dominating graph of $G$, $D_k(G)$, is defined to be the graph whose vertices correspond to the dominating sets of $G$ that have cardinality at most $k$. Two vertices in $D_k(G)$ are adjacent if and only if the corresponding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ee0c39347e65d97a3684404849d857c
https://doi.org/10.1007/s00373-013-1302-3
https://doi.org/10.1007/s00373-013-1302-3
Autor:
Richard J. Nowakowski, Karen Seyffarth
Publikováno v:
Graphs and Combinatorics. 25:385-400
We continue the study of small cycle double covers of products of graphs that began in [7], concentrating here on the categorical product and the strong product. Under the assumption that G has an SCDC, we show that G × P m has an SCDC for all m ≠
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b180b58f9c1722d94e9935e09e7d6495
https://doi.org/10.1007/s00373-009-0844-x
https://doi.org/10.1007/s00373-009-0844-x
Publikováno v:
Discrete Mathematics. 257:39-61
It has been shown by MacGillivray and Seyffarth (Austral. J. Combin. 24 (2001) 91) that bridgeless line graphs of complete graphs, complete bipartite graphs, and planar graphs have small cycle double covers. In this paper, we extend the result for co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6e7b432933e9919de54066c1d539bda
https://doi.org/10.1016/s0012-365x(02)00258-3
https://doi.org/10.1016/s0012-365x(02)00258-3