Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Karen Seyffarth
@article{DBLP:journals/gc/AdarichevaBBCHM22, author = {Kira V. Adaricheva and Heather C. Smith Blake and Chassidy Bozeman and Nancy E. Clarke and Ruth Haas and Margaret{-}Ellen Messinger and Karen Seyffarth}, title = {Hamilton Paths in Dominating Graphs of Trees and Cycles}, journal = {Graphs Comb.}, volume = {38}, number = {6}, pages = {174}, year = {2022}, url = {https://doi.org/10.1007/s00373-022-02579-8}, doi = {10.1007/S00373-022-02579-8}, timestamp = {Sun, 25 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/gc/AdarichevaBBCHM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arsmc/CaversS19, author = {Michael S. Cavers and Karen Seyffarth}, title = {Reconfiguring vertex colourings of 2-trees}, journal = {Ars Math. Contemp.}, volume = {17}, number = {2}, pages = {653--698}, year = {2019}, url = {https://doi.org/10.26493/1855-3974.1813.7ae}, doi = {10.26493/1855-3974.1813.7AE}, timestamp = {Mon, 13 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arsmc/CaversS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/RapkeS18, author = {T. K. Rapke and Karen Seyffarth}, title = {On nice and injective-nice tournaments}, journal = {Discret. Math.}, volume = {341}, number = {1}, pages = {1--19}, year = {2018}, url = {https://doi.org/10.1016/j.disc.2017.06.006}, doi = {10.1016/J.DISC.2017.06.006}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/RapkeS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/CaversSW18, author = {Michael S. Cavers and Karen Seyffarth and Ethan P. White}, title = {Distinguishing chromatic numbers of complements of Cartesian products of complete graphs}, journal = {Discret. Math.}, volume = {341}, number = {9}, pages = {2431--2441}, year = {2018}, url = {https://doi.org/10.1016/j.disc.2018.05.016}, doi = {10.1016/J.DISC.2018.05.016}, timestamp = {Wed, 19 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/CaversSW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HaasS17, author = {Ruth Haas and Karen Seyffarth}, title = {Reconfiguring dominating sets in some well-covered and other classes of graphs}, journal = {Discret. Math.}, volume = {340}, number = {8}, pages = {1802--1817}, year = {2017}, url = {https://doi.org/10.1016/j.disc.2017.03.007}, doi = {10.1016/J.DISC.2017.03.007}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/HaasS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/HaasS14, author = {Ruth Haas and Karen Seyffarth}, title = {The k-Dominating Graph}, journal = {Graphs Comb.}, volume = {30}, number = {3}, pages = {609--617}, year = {2014}, url = {https://doi.org/10.1007/s00373-013-1302-3}, doi = {10.1007/S00373-013-1302-3}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/HaasS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/CaversS13, author = {Michael S. Cavers and Karen Seyffarth}, title = {Graphs with Large Distinguishing Chromatic Number}, journal = {Electron. J. Comb.}, volume = {20}, number = {1}, pages = {19}, year = {2013}, url = {https://doi.org/10.37236/2407}, doi = {10.37236/2407}, timestamp = {Fri, 10 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/CaversS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/LaflammeS09, author = {Claude Laflamme and Karen Seyffarth}, title = {Distinguishing Chromatic Numbers of Bipartite Graphs}, journal = {Electron. J. Comb.}, volume = {16}, number = {1}, year = {2009}, url = {https://doi.org/10.37236/165}, doi = {10.37236/165}, timestamp = {Fri, 10 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/LaflammeS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/NowakowskiS09, author = {Richard J. Nowakowski and Karen Seyffarth}, title = {Small Cycle Double Covers of Products {II:} Categorical and Strong Products with Paths and Cycles}, journal = {Graphs Comb.}, volume = {25}, number = {3}, pages = {385--400}, year = {2009}, url = {https://doi.org/10.1007/s00373-009-0844-x}, doi = {10.1007/S00373-009-0844-X}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/NowakowskiS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/NowakowskiS08, author = {Richard J. Nowakowski and Karen Seyffarth}, title = {Small cycle double covers of products {I:} Lexicographic product with paths and cycles}, journal = {J. Graph Theory}, volume = {57}, number = {2}, pages = {99--123}, year = {2008}, url = {https://doi.org/10.1002/jgt.20265}, doi = {10.1002/JGT.20265}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/NowakowskiS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/SeyffarthW05, author = {Karen Seyffarth and Chengde Wang}, title = {On eulerian and regular perfect path double covers of graphs}, journal = {Discret. Math.}, volume = {293}, number = {1-3}, pages = {237--250}, year = {2005}, url = {https://doi.org/10.1016/j.disc.2004.08.038}, doi = {10.1016/J.DISC.2004.08.038}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/SeyffarthW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/FishKS02, author = {J. M. Fish and Regina Klimmek and Karen Seyffarth}, title = {Line graphs of complete multipartite graphs have small cycle double covers}, journal = {Discret. Math.}, volume = {257}, number = {1}, pages = {39--61}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(02)00258-3}, doi = {10.1016/S0012-365X(02)00258-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/FishKS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/ChattopadhyayHS02, author = {Subhendu Chattopadhyay and Lisa Higham and Karen Seyffarth}, editor = {Aleta Ricciardi}, title = {Dynamic and self-stabilizing distributed matching}, booktitle = {Proceedings of the Twenty-First Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2002, Monterey, California, USA, July 21-24, 2002}, pages = {290--297}, publisher = {{ACM}}, year = {2002}, url = {https://doi.org/10.1145/571825.571877}, doi = {10.1145/571825.571877}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/ChattopadhyayHS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ajc/MacGillivrayS01, author = {Gary MacGillivray and Karen Seyffarth}, title = {Classes of line graphs with small cycle double covers}, journal = {Australas. {J} Comb.}, volume = {24}, pages = {91--114}, year = {2001}, url = {http://ajc.maths.uq.edu.au/pdf/24/ocr-ajc-v24-p91.pdf}, timestamp = {Wed, 11 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ajc/MacGillivrayS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ajc/HellS98, author = {Pavol Hell and Karen Seyffarth}, title = {Broadcasting in planar graphs}, journal = {Australas. {J} Comb.}, volume = {17}, pages = {309}, year = {1998}, url = {http://ajc.maths.uq.edu.au/pdf/17/ocr-ajc-v17-p309.pdf}, timestamp = {Wed, 11 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ajc/HellS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/FellowsHS98, author = {Michael R. Fellows and Pavol Hell and Karen Seyffarth}, title = {Constructions of large planar networks with given degree and diameter}, journal = {Networks}, volume = {32}, number = {4}, pages = {275--281}, year = {1998}, url = {https://doi.org/10.1002/(SICI)1097-0037(199812)32:4\&\#60;275::AID-NET4\&\#62;3.0.CO;2-G}, doi = {10.1002/(SICI)1097-0037(199812)32:4\&\#60;275::AID-NET4\&\#62;3.0.CO;2-G}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/FellowsHS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MacGillivrayS96, author = {Gary MacGillivray and Karen Seyffarth}, title = {Domination numbers of planar graphs}, journal = {J. Graph Theory}, volume = {22}, number = {3}, pages = {213--229}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1097-0118(199607)22:3\&\#60;213::AID-JGT2\&\#62;3.0.CO;2-P}, doi = {10.1002/(SICI)1097-0118(199607)22:3\&\#60;213::AID-JGT2\&\#62;3.0.CO;2-P}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MacGillivrayS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FellowsHS95, author = {Michael R. Fellows and Pavol Hell and Karen Seyffarth}, title = {Large Planar Graphs with Given Diameter and Maximum Degree}, journal = {Discret. Appl. Math.}, volume = {61}, number = {2}, pages = {133--153}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00011-2}, doi = {10.1016/0166-218X(94)00011-2}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FellowsHS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/Seyffarth93, author = {Karen Seyffarth}, title = {Small cycle double covers of 4-connected planer}, journal = {Comb.}, volume = {13}, number = {4}, pages = {477--482}, year = {1993}, url = {https://doi.org/10.1007/BF01303519}, doi = {10.1007/BF01303519}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/Seyffarth93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HellS93, author = {Pavol Hell and Karen Seyffarth}, title = {Largest planar graphs of diameter two and fixed maximum degree}, journal = {Discret. Math.}, volume = {111}, number = {1-3}, pages = {313--322}, year = {1993}, url = {https://doi.org/10.1016/0012-365X(93)90166-Q}, doi = {10.1016/0012-365X(93)90166-Q}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HellS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Seyffarth93, author = {Karen Seyffarth}, title = {Packings and perfect path double covers of maximal planar graphs}, journal = {Discret. Math.}, volume = {117}, number = {1-3}, pages = {183--195}, year = {1993}, url = {https://doi.org/10.1016/0012-365X(93)90334-P}, doi = {10.1016/0012-365X(93)90334-P}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Seyffarth93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Seyffarth92, author = {Karen Seyffarth}, title = {Haj{\'{o}}s' conjecture and small cycle double covers of planar graphs}, journal = {Discret. Math.}, volume = {101}, number = {1-3}, pages = {291--306}, year = {1992}, url = {https://doi.org/10.1016/0012-365X(92)90610-R}, doi = {10.1016/0012-365X(92)90610-R}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/Seyffarth92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Seyffarth89, author = {Karen Seyffarth}, title = {Maximal planar graphs of diameter two}, journal = {J. Graph Theory}, volume = {13}, number = {5}, pages = {619--648}, year = {1989}, url = {https://doi.org/10.1002/jgt.3190130512}, doi = {10.1002/JGT.3190130512}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Seyffarth89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.