Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Hal A. Kierstead

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Hal A. Kierstead

download as .bib file

@article{DBLP:journals/dm/KiersteadR23,
  author       = {Henry A. Kierstead and
                  Eric R. Ren},
  title        = {Improved upper bounds on longest-path and maximal-subdivision transversals},
  journal      = {Discret. Math.},
  volume       = {346},
  number       = {9},
  pages        = {113514},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disc.2023.113514},
  doi          = {10.1016/J.DISC.2023.113514},
  timestamp    = {Thu, 07 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ChoiKR23,
  author       = {Ilkyoo Choi and
                  Henry A. Kierstead and
                  Landon Rabern},
  title        = {The list version of the Borodin-Kostochka conjecture for graphs with
                  large maximum degree},
  journal      = {Discret. Math.},
  volume       = {346},
  number       = {11},
  pages        = {113300},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disc.2022.113300},
  doi          = {10.1016/J.DISC.2022.113300},
  timestamp    = {Thu, 14 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/ChoiKR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/RabernCK23,
  author       = {Brian Rabern and
                  Daniel W. Cranston and
                  Henry A. Kierstead},
  title        = {Special issue in honour of Landon Rabern},
  journal      = {Discret. Math.},
  volume       = {346},
  number       = {11},
  pages        = {113507},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disc.2023.113507},
  doi          = {10.1016/J.DISC.2023.113507},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/RabernCK23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/AlmulhimK22,
  author       = {Ahlam Almulhim and
                  Hal A. Kierstead},
  title        = {On the weak 2-coloring number of planar graphs},
  journal      = {Discret. Math.},
  volume       = {345},
  number       = {1},
  pages        = {112631},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.disc.2021.112631},
  doi          = {10.1016/J.DISC.2021.112631},
  timestamp    = {Wed, 15 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AlmulhimK22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GuKOQZ22,
  author       = {Yangyan Gu and
                  Hal A. Kierstead and
                  Sang{-}il Oum and
                  Hao Qi and
                  Xuding Zhu},
  title        = {3-Degenerate induced subgraph of a planar graph},
  journal      = {J. Graph Theory},
  volume       = {99},
  number       = {2},
  pages        = {251--277},
  year         = {2022},
  url          = {https://doi.org/10.1002/jgt.22740},
  doi          = {10.1002/JGT.22740},
  timestamp    = {Mon, 30 Oct 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/GuKOQZ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HanKZ21,
  author       = {Ming Han and
                  Hal A. Kierstead and
                  Xuding Zhu},
  title        = {Every planar graph is 1-defective (9, 2)-paintable},
  journal      = {Discret. Appl. Math.},
  volume       = {294},
  pages        = {257--264},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.02.008},
  doi          = {10.1016/J.DAM.2021.02.008},
  timestamp    = {Wed, 07 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/HanKZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/HeuvelK21,
  author       = {Jan van den Heuvel and
                  Henry A. Kierstead},
  title        = {Uniform orderings for generalized coloring numbers},
  journal      = {Eur. J. Comb.},
  volume       = {91},
  pages        = {103214},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.ejc.2020.103214},
  doi          = {10.1016/J.EJC.2020.103214},
  timestamp    = {Fri, 16 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/HeuvelK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadYY20,
  author       = {Hal A. Kierstead and
                  Daqing Yang and
                  Junjun Yi},
  title        = {On coloring numbers of graph powers},
  journal      = {Discret. Math.},
  volume       = {343},
  number       = {6},
  pages        = {111712},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.disc.2019.111712},
  doi          = {10.1016/J.DISC.2019.111712},
  timestamp    = {Mon, 20 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadYY20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/KiersteadR20,
  author       = {Hal A. Kierstead and
                  Landon Rabern},
  title        = {Improved lower bounds on the number of edges in list critical and
                  online list critical graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {140},
  pages        = {147--170},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.jctb.2019.05.004},
  doi          = {10.1016/J.JCTB.2019.05.004},
  timestamp    = {Mon, 20 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/KiersteadR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/HeuvelKQ19,
  author       = {Jan van den Heuvel and
                  Hal A. Kierstead and
                  Daniel A. Quiroz},
  title        = {Chromatic numbers of exact distance graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {134},
  pages        = {143--163},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.jctb.2018.05.007},
  doi          = {10.1016/J.JCTB.2018.05.007},
  timestamp    = {Wed, 30 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/HeuvelKQ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1907-12149,
  author       = {Jan van den Heuvel and
                  Hal A. Kierstead},
  title        = {Uniform Orderings for Generalized Coloring Numbers},
  journal      = {CoRR},
  volume       = {abs/1907.12149},
  year         = {2019},
  url          = {http://arxiv.org/abs/1907.12149},
  eprinttype    = {arXiv},
  eprint       = {1907.12149},
  timestamp    = {Mon, 20 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1907-12149.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/BosekKKMS18,
  author       = {Bartlomiej Bosek and
                  Hal A. Kierstead and
                  Tomasz Krawczyk and
                  Grzegorz Matecki and
                  Matthew E. Smith},
  title        = {An Easy Subexponential Bound for Online Chain Partitioning},
  journal      = {Electron. J. Comb.},
  volume       = {25},
  number       = {2},
  pages        = {2},
  year         = {2018},
  url          = {https://doi.org/10.37236/7231},
  doi          = {10.37236/7231},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/BosekKKMS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cpc/KiersteadKM18,
  author       = {Hal A. Kierstead and
                  Alexandr V. Kostochka and
                  Andrew McConvey},
  title        = {A Sharp Dirac-Erd{\H{o}}s Type Bound for Large Graphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {27},
  number       = {3},
  pages        = {387--397},
  year         = {2018},
  url          = {https://doi.org/10.1017/S0963548318000020},
  doi          = {10.1017/S0963548318000020},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/KiersteadKM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorica/KiersteadKY17,
  author       = {Henry A. Kierstead and
                  Alexandr V. Kostochka and
                  Elyse Yeager},
  title        = {The (2k-1)-connected multigraphs with at most k-1 disjoint cycles},
  journal      = {Comb.},
  volume       = {37},
  number       = {1},
  pages        = {77--86},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00493-015-3291-8},
  doi          = {10.1007/S00493-015-3291-8},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KiersteadKY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/KiersteadKY17,
  author       = {Henry A. Kierstead and
                  Alexandr V. Kostochka and
                  Elyse Yeager},
  title        = {On the Corr{\'{a}}di-Hajnal theorem and a question of Dirac},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {122},
  pages        = {121--148},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jctb.2016.05.007},
  doi          = {10.1016/J.JCTB.2016.05.007},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/KiersteadKY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KiersteadKM17,
  author       = {Hal A. Kierstead and
                  Alexandr V. Kostochka and
                  Andrew McConvey},
  title        = {Strengthening Theorems of Dirac and Erd{\H{o}}s on Disjoint Cycles},
  journal      = {J. Graph Theory},
  volume       = {85},
  number       = {4},
  pages        = {788--802},
  year         = {2017},
  url          = {https://doi.org/10.1002/jgt.22106},
  doi          = {10.1002/JGT.22106},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KiersteadKM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KiersteadR17,
  author       = {Hal A. Kierstead and
                  Landon Rabern},
  title        = {Extracting List Colorings from Large Independent Sets},
  journal      = {J. Graph Theory},
  volume       = {86},
  number       = {3},
  pages        = {315--328},
  year         = {2017},
  url          = {https://doi.org/10.1002/jgt.22128},
  doi          = {10.1002/JGT.22128},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KiersteadR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/KiersteadST16,
  author       = {Hal A. Kierstead and
                  David A. Smith and
                  William T. Trotter},
  title        = {First-fit coloring on interval graphs has performance ratio at least
                  5},
  journal      = {Eur. J. Comb.},
  volume       = {51},
  pages        = {236--254},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.ejc.2015.05.015},
  doi          = {10.1016/J.EJC.2015.05.015},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/KiersteadST16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/KiersteadSW16,
  author       = {Hal A. Kierstead and
                  Andrew Salmon and
                  Ran Wang},
  title        = {On the choice number of complete multipartite graphs with part size
                  four},
  journal      = {Eur. J. Comb.},
  volume       = {58},
  pages        = {1--16},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.ejc.2016.05.001},
  doi          = {10.1016/J.EJC.2016.05.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/KiersteadSW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorica/KiersteadK15,
  author       = {Hal A. Kierstead and
                  Alexandr V. Kostochka},
  title        = {A refinement of a result of Corr{\'{a}}di and Hajnal},
  journal      = {Comb.},
  volume       = {35},
  number       = {4},
  pages        = {497--512},
  year         = {2015},
  url          = {https://doi.org/10.1007/s00493-014-3059-6},
  doi          = {10.1007/S00493-014-3059-6},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KiersteadK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cpc/CzygrinowDKM15,
  author       = {Andrzej Czygrinow and
                  Louis DeBiasio and
                  Hal A. Kierstead and
                  Theodore Molla},
  title        = {An Extension of the Hajnal-Szemer{\'{e}}di Theorem to Directed
                  Graphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {24},
  number       = {5},
  pages        = {754--773},
  year         = {2015},
  url          = {https://doi.org/10.1017/S0963548314000716},
  doi          = {10.1017/S0963548314000716},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/CzygrinowDKM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadL15,
  author       = {Hal A. Kierstead and
                  Bernard Lidick{\'{y}}},
  title        = {On choosability with separation of planar graphs with lists of different
                  sizes},
  journal      = {Discret. Math.},
  volume       = {338},
  number       = {10},
  pages        = {1779--1783},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.disc.2015.01.008},
  doi          = {10.1016/J.DISC.2015.01.008},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/HaxellK15,
  author       = {Penny E. Haxell and
                  Hal A. Kierstead},
  title        = {Edge coloring multigraphs without small dense subsets},
  journal      = {Discret. Math.},
  volume       = {338},
  number       = {12},
  pages        = {2502--2506},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.disc.2015.06.022},
  doi          = {10.1016/J.DISC.2015.06.022},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/HaxellK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icc/WangZMDKS15,
  author       = {Ran Wang and
                  Chenyang Zhou and
                  Anisha Mazumder and
                  Arun Das and
                  Hal A. Kierstead and
                  Arunabha Sen},
  title        = {Upper and lower bounds of Choice Number for successful channel assignment
                  in cellular networks},
  booktitle    = {2015 {IEEE} International Conference on Communications, {ICC} 2015,
                  London, United Kingdom, June 8-12, 2015},
  pages        = {3370--3375},
  publisher    = {{IEEE}},
  year         = {2015},
  url          = {https://doi.org/10.1109/ICC.2015.7248845},
  doi          = {10.1109/ICC.2015.7248845},
  timestamp    = {Tue, 31 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icc/WangZMDKS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dmtcs/KiersteadS14,
  author       = {Hal A. Kierstead and
                  Karin Rebecca Saoub},
  title        = {Generalized Dynamic Storage Allocation},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {16},
  number       = {3},
  pages        = {253--262},
  year         = {2014},
  url          = {https://doi.org/10.46298/dmtcs.2083},
  doi          = {10.46298/DMTCS.2083},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/KiersteadS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/CzygrinowKM14,
  author       = {Andrzej Czygrinow and
                  Hal A. Kierstead and
                  Theodore Molla},
  title        = {On directed versions of the Corr{\'{a}}di-Hajnal corollary},
  journal      = {Eur. J. Comb.},
  volume       = {42},
  pages        = {1--14},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.ejc.2014.05.006},
  doi          = {10.1016/J.EJC.2014.05.006},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/CzygrinowKM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BosekKKMS14,
  author       = {Bartlomiej Bosek and
                  Hal A. Kierstead and
                  Tomasz Krawczyk and
                  Grzegorz Matecki and
                  Matthew E. Smith},
  title        = {An Improved Subexponential Bound for On-line Chain Partitioning},
  journal      = {CoRR},
  volume       = {abs/1410.3247},
  year         = {2014},
  url          = {http://arxiv.org/abs/1410.3247},
  eprinttype    = {arXiv},
  eprint       = {1410.3247},
  timestamp    = {Thu, 23 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BosekKKMS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/KiersteadS13,
  author       = {Hal A. Kierstead and
                  Matt Earl Smith},
  title        = {On first-fit coloring of ladder-free posets},
  journal      = {Eur. J. Comb.},
  volume       = {34},
  number       = {2},
  pages        = {474--489},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ejc.2012.07.007},
  doi          = {10.1016/J.EJC.2012.07.007},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/KiersteadS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KiersteadK13,
  author       = {Hal A. Kierstead and
                  Alexandr V. Kostochka},
  title        = {Equitable List Coloring of Graphs with Bounded Degree},
  journal      = {J. Graph Theory},
  volume       = {74},
  number       = {3},
  pages        = {309--334},
  year         = {2013},
  url          = {https://doi.org/10.1002/jgt.21710},
  doi          = {10.1002/JGT.21710},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KiersteadK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/KiersteadL13,
  author       = {Hal A. Kierstead and
                  Bernard Lidick{\'{y}}},
  title        = {On choosability with separation of planar graphs with lists of different
                  sizes},
  journal      = {CoRR},
  volume       = {abs/1306.5283},
  year         = {2013},
  url          = {http://arxiv.org/abs/1306.5283},
  eprinttype    = {arXiv},
  eprint       = {1306.5283},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KiersteadL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/KiersteadYYZ12,
  author       = {Hal A. Kierstead and
                  Chung{-}Ying Yang and
                  Daqing Yang and
                  Xuding Zhu},
  title        = {Adapted game colouring of graphs},
  journal      = {Eur. J. Comb.},
  volume       = {33},
  number       = {4},
  pages        = {435--445},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ejc.2011.11.001},
  doi          = {10.1016/J.EJC.2011.11.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/KiersteadYYZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KiersteadK12,
  author       = {Henry A. Kierstead and
                  Alexandr V. Kostochka},
  title        = {Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring},
  journal      = {J. Graph Theory},
  volume       = {71},
  number       = {1},
  pages        = {31--48},
  year         = {2012},
  url          = {https://doi.org/10.1002/jgt.20630},
  doi          = {10.1002/JGT.20630},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KiersteadK12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KiersteadS11,
  author       = {Hal A. Kierstead and
                  Karin Rebecca Saoub},
  title        = {First-Fit coloring of bounded tolerance graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {159},
  number       = {7},
  pages        = {605--611},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.dam.2010.05.002},
  doi          = {10.1016/J.DAM.2010.05.002},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KiersteadS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/FanKLMWZ11,
  author       = {Hao Fan and
                  Hal A. Kierstead and
                  Guizhen Liu and
                  Theodore Molla and
                  Jianliang Wu and
                  Xin Zhang},
  title        = {A note on relaxed equitable coloring of graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {111},
  number       = {21-22},
  pages        = {1062--1066},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.ipl.2011.08.001},
  doi          = {10.1016/J.IPL.2011.08.001},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/FanKLMWZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/ChauDK11,
  author       = {Phong Ch{\^{a}}u and
                  Louis DeBiasio and
                  Hal A. Kierstead},
  title        = {P{\'{o}}sa's conjecture for graphs of order at least 2 {\texttimes}
                  10\({}^{\mbox{8}}\)},
  journal      = {Random Struct. Algorithms},
  volume       = {39},
  number       = {4},
  pages        = {507--525},
  year         = {2011},
  url          = {https://doi.org/10.1002/rsa.20376},
  doi          = {10.1002/RSA.20376},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/ChauDK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorica/KiersteadK10,
  author       = {Henry A. Kierstead and
                  Alexandr V. Kostochka},
  title        = {Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture},
  journal      = {Comb.},
  volume       = {30},
  number       = {2},
  pages        = {201--216},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00493-010-2420-7},
  doi          = {10.1007/S00493-010-2420-7},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KiersteadK10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorica/KiersteadKMS10,
  author       = {Henry A. Kierstead and
                  Alexandr V. Kostochka and
                  Marcelo Mydlarz and
                  Endre Szemer{\'{e}}di},
  title        = {A fast algorithm for equitable coloring},
  journal      = {Comb.},
  volume       = {30},
  number       = {2},
  pages        = {217--224},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00493-010-2483-5},
  doi          = {10.1007/S00493-010-2483-5},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KiersteadKMS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/CushingK10,
  author       = {William Cushing and
                  Hal A. Kierstead},
  title        = {Planar graphs are 1-relaxed, 4-choosable},
  journal      = {Eur. J. Comb.},
  volume       = {31},
  number       = {5},
  pages        = {1385--1397},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.ejc.2009.11.013},
  doi          = {10.1016/J.EJC.2009.11.013},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/CushingK10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/CzygrinowDK10,
  author       = {Andrzej Czygrinow and
                  Louis DeBiasio and
                  Hal A. Kierstead},
  title        = {2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {24},
  number       = {2},
  pages        = {486--504},
  year         = {2010},
  url          = {https://doi.org/10.1137/080739513},
  doi          = {10.1137/080739513},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/CzygrinowDK10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorica/KiersteadK09,
  author       = {Hal A. Kierstead and
                  Goran Konjevod},
  title        = {Coloring number and on-line Ramsey theory for graphs and hypergraphs},
  journal      = {Comb.},
  volume       = {29},
  number       = {1},
  pages        = {49--64},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00493-009-2264-1},
  doi          = {10.1007/S00493-009-2264-1},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KiersteadK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cpc/KiersteadK09,
  author       = {Hal A. Kierstead and
                  Alexandr V. Kostochka},
  title        = {Efficient Graph Packing via Game Colouring},
  journal      = {Comb. Probab. Comput.},
  volume       = {18},
  number       = {5},
  pages        = {765--774},
  year         = {2009},
  url          = {https://doi.org/10.1017/S0963548309009973},
  doi          = {10.1017/S0963548309009973},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/KiersteadK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/KiersteadK09,
  author       = {Hal A. Kierstead and
                  Alexandr V. Kostochka},
  title        = {Ore-type versions of Brooks' theorem},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {99},
  number       = {2},
  pages        = {298--305},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.jctb.2008.06.007},
  doi          = {10.1016/J.JCTB.2008.06.007},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/KiersteadK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KiersteadKT09,
  author       = {Hal A. Kierstead and
                  Andr{\'{e}} K{\"{u}}ndgen and
                  Craig Timmons},
  title        = {Star coloring bipartite planar graphs},
  journal      = {J. Graph Theory},
  volume       = {60},
  number       = {1},
  pages        = {1--10},
  year         = {2009},
  url          = {https://doi.org/10.1002/jgt.20342},
  doi          = {10.1002/JGT.20342},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KiersteadKT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/KiersteadMSYZ09,
  author       = {Hal A. Kierstead and
                  Bojan Mohar and
                  Simon Spacapan and
                  Daqing Yang and
                  Xuding Zhu},
  title        = {The Two-Coloring Number and Degenerate Colorings of Planar Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {23},
  number       = {3},
  pages        = {1548--1560},
  year         = {2009},
  url          = {https://doi.org/10.1137/070703697},
  doi          = {10.1137/070703697},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/KiersteadMSYZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cpc/KiersteadK08,
  author       = {Hal A. Kierstead and
                  Alexandr V. Kostochka},
  title        = {A Short Proof of the Hajnal-Szemer{\'{e}}di Theorem on Equitable
                  Colouring},
  journal      = {Comb. Probab. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {265--270},
  year         = {2008},
  url          = {https://doi.org/10.1017/S0963548307008619},
  doi          = {10.1017/S0963548307008619},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/KiersteadK08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BartnickiGK08,
  author       = {Tomasz Bartnicki and
                  Jaroslaw Grytczuk and
                  Hal A. Kierstead},
  title        = {The game of arboricity},
  journal      = {Discret. Math.},
  volume       = {308},
  number       = {8},
  pages        = {1388--1393},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.disc.2007.07.066},
  doi          = {10.1016/J.DISC.2007.07.066},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/BartnickiGK08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/YangK08,
  author       = {Daqing Yang and
                  Hal A. Kierstead},
  title        = {Asymmetric marking games on line graphs},
  journal      = {Discret. Math.},
  volume       = {308},
  number       = {9},
  pages        = {1751--1755},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.disc.2007.03.082},
  doi          = {10.1016/J.DISC.2007.03.082},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/YangK08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dmtcs/GrytczukKP08,
  author       = {Jaroslaw Grytczuk and
                  Hal A. Kierstead and
                  Pawel Pralat},
  title        = {On-line Ramsey Numbers for Paths and Stars},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {10},
  number       = {3},
  year         = {2008},
  url          = {https://doi.org/10.46298/dmtcs.427},
  doi          = {10.46298/DMTCS.427},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/GrytczukKP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/KiersteadK08,
  author       = {Hal A. Kierstead and
                  Alexandr V. Kostochka},
  title        = {An Ore-type theorem on equitable coloring},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {98},
  number       = {1},
  pages        = {226--234},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.jctb.2007.07.003},
  doi          = {10.1016/J.JCTB.2007.07.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/KiersteadK08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tamm/BartnickiGKZ07,
  author       = {Tomasz Bartnicki and
                  Jaroslaw Grytczuk and
                  Hal A. Kierstead and
                  Xuding Zhu},
  title        = {The Map-Coloring Game},
  journal      = {Am. Math. Mon.},
  volume       = {114},
  number       = {9},
  pages        = {793--803},
  year         = {2007},
  url          = {http://www.jstor.org/stable/27642332},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tamm/BartnickiGKZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kierstead06,
  author       = {Henry A. Kierstead},
  title        = {Weak acyclic coloring and asymmetric coloring games},
  journal      = {Discret. Math.},
  volume       = {306},
  number       = {7},
  pages        = {673--677},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disc.2004.07.042},
  doi          = {10.1016/J.DISC.2004.07.042},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kierstead06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/AlonBKKW06,
  author       = {Noga Alon and
                  Graham R. Brightwell and
                  Hal A. Kierstead and
                  Alexandr V. Kostochka and
                  Peter Winkler},
  title        = {Dominating sets in k-majority tournaments},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {96},
  number       = {3},
  pages        = {374--387},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jctb.2005.09.003},
  doi          = {10.1016/J.JCTB.2005.09.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/AlonBKKW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Kierstead05,
  author       = {Hal A. Kierstead},
  title        = {Asymmetric graph coloring games},
  journal      = {J. Graph Theory},
  volume       = {48},
  number       = {3},
  pages        = {169--185},
  year         = {2005},
  url          = {https://doi.org/10.1002/jgt.20049},
  doi          = {10.1002/JGT.20049},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Kierstead05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/order/KiersteadY05,
  author       = {Hal A. Kierstead and
                  Daqing Yang},
  title        = {Very Asymmetric Marking Games},
  journal      = {Order},
  volume       = {22},
  number       = {2},
  pages        = {93--107},
  year         = {2005},
  url          = {https://doi.org/10.1007/s11083-005-9012-y},
  doi          = {10.1007/S11083-005-9012-Y},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/order/KiersteadY05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/AlbertsonCKKR04,
  author       = {Michael O. Albertson and
                  Glenn G. Chappell and
                  Henry A. Kierstead and
                  Andr{\'{e}} K{\"{u}}ndgen and
                  Radhika Ramamurthi},
  title        = {Coloring with no 2-Colored P\({}_{\mbox{4}}\)'s},
  journal      = {Electron. J. Comb.},
  volume       = {11},
  number       = {1},
  year         = {2004},
  url          = {https://doi.org/10.37236/1779},
  doi          = {10.37236/1779},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/AlbertsonCKKR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/GrytczukHK04,
  author       = {Jaroslaw Grytczuk and
                  Mariusz Haluszczak and
                  Henry A. Kierstead},
  title        = {On-line Ramsey Theory},
  journal      = {Electron. J. Comb.},
  volume       = {11},
  number       = {1},
  year         = {2004},
  url          = {https://doi.org/10.37236/1810},
  doi          = {10.37236/1810},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/GrytczukHK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/DunnK04a,
  author       = {Charles L. Dunn and
                  Hal A. Kierstead},
  title        = {A simple competitive graph coloring algorithm {II}},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {90},
  number       = {1},
  pages        = {93--106},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0095-8956(03)00077-7},
  doi          = {10.1016/S0095-8956(03)00077-7},
  timestamp    = {Wed, 01 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/DunnK04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/DunnK04,
  author       = {Charles L. Dunn and
                  Hal A. Kierstead},
  title        = {A simple competitive graph coloring algorithm {III}},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {92},
  number       = {1},
  pages        = {137--150},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jctb.2004.03.010},
  doi          = {10.1016/J.JCTB.2004.03.010},
  timestamp    = {Wed, 01 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/DunnK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/DunnK04,
  author       = {Charles L. Dunn and
                  Hal A. Kierstead},
  title        = {The relaxed game chromatic number of outerplanar graphs},
  journal      = {J. Graph Theory},
  volume       = {46},
  number       = {1},
  pages        = {69--78},
  year         = {2004},
  url          = {https://doi.org/10.1002/jgt.10172},
  doi          = {10.1002/JGT.10172},
  timestamp    = {Wed, 01 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/DunnK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/order/JohnsonK04,
  author       = {J. Robert Johnson and
                  Henry A. Kierstead},
  title        = {Explicit 2-Factorisations of the Odd Graph},
  journal      = {Order},
  volume       = {21},
  number       = {1},
  pages        = {19--27},
  year         = {2004},
  url          = {https://doi.org/10.1007/s11083-004-3344-x},
  doi          = {10.1007/S11083-004-3344-X},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/order/JohnsonK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/KiersteadZ04,
  author       = {Hal A. Kierstead and
                  Yingxian Zhu},
  title        = {Radius Three Trees in Graphs with Large Chromatic Number},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {17},
  number       = {4},
  pages        = {571--581},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0895480198339869},
  doi          = {10.1137/S0895480198339869},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/KiersteadZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/gc/KiersteadT03,
  author       = {Hal A. Kierstead and
                  Zsolt Tuza},
  title        = {Marking Games and the Oriented Game Chromatic Number of Partial k-Trees},
  journal      = {Graphs Comb.},
  volume       = {19},
  number       = {1},
  pages        = {121--129},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00373-002-0489-5},
  doi          = {10.1007/S00373-002-0489-5},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/KiersteadT03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/order/KiersteadY03,
  author       = {Hal A. Kierstead and
                  Daqing Yang},
  title        = {Orderings on Graphs and Game Coloring Number},
  journal      = {Order},
  volume       = {20},
  number       = {3},
  pages        = {255--264},
  year         = {2003},
  url          = {https://doi.org/10.1023/B:ORDE.0000026489.93166.cb},
  doi          = {10.1023/B:ORDE.0000026489.93166.CB},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/order/KiersteadY03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CzygrinowK02,
  author       = {Andrzej Czygrinow and
                  Henry A. Kierstead},
  title        = {2-factors in dense bipartite graphs},
  journal      = {Discret. Math.},
  volume       = {257},
  number       = {2-3},
  pages        = {357--369},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0012-365X(02)00435-1},
  doi          = {10.1016/S0012-365X(02)00435-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CzygrinowK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/gc/CzygrinowHKT02,
  author       = {Andrzej Czygrinow and
                  Glenn Hurlbert and
                  Hal A. Kierstead and
                  William T. Trotter},
  title        = {A Note on Graph Pebbling},
  journal      = {Graphs Comb.},
  volume       = {18},
  number       = {2},
  pages        = {219--225},
  year         = {2002},
  url          = {https://doi.org/10.1007/s003730200015},
  doi          = {10.1007/S003730200015},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/CzygrinowHKT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/CzygrinowFHKT01,
  author       = {Andrzej Czygrinow and
                  Genghua Fan and
                  Glenn Hurlbert and
                  Henry A. Kierstead and
                  William T. Trotter},
  title        = {Spanning Trees of Bounded Degree},
  journal      = {Electron. J. Comb.},
  volume       = {8},
  number       = {1},
  year         = {2001},
  url          = {https://doi.org/10.37236/1577},
  doi          = {10.37236/1577},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/CzygrinowFHKT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/KiersteadT01,
  author       = {Henry A. Kierstead and
                  William T. Trotter},
  title        = {Competitive Colorings of Oriented Graphs},
  journal      = {Electron. J. Comb.},
  volume       = {8},
  number       = {2},
  year         = {2001},
  url          = {https://doi.org/10.37236/1611},
  doi          = {10.37236/1611},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/KiersteadT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kierstead00a,
  author       = {Henry A. Kierstead},
  title        = {On the choosability of complete multipartite graphs with part size
                  three},
  journal      = {Discret. Math.},
  volume       = {211},
  pages        = {255--259},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0012-365X(99)00157-0},
  doi          = {10.1016/S0012-365X(99)00157-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kierstead00a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadT00,
  author       = {Henry A. Kierstead and
                  William T. Trotter},
  title        = {Interval orders and dimension},
  journal      = {Discret. Math.},
  volume       = {213},
  number       = {1-3},
  pages        = {179--188},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0012-365X(99)00178-8},
  doi          = {10.1016/S0012-365X(99)00178-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kierstead00,
  author       = {Hal A. Kierstead},
  title        = {Extending partial colorings of graphs},
  journal      = {Discret. Math.},
  volume       = {219},
  number       = {1-3},
  pages        = {145--152},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0012-365X(99)00372-6},
  doi          = {10.1016/S0012-365X(99)00372-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kierstead00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Kierstead00,
  author       = {Hal A. Kierstead},
  title        = {A Simple Competitive Graph Coloring Algorithm},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {78},
  number       = {1},
  pages        = {57--68},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.1999.1927},
  doi          = {10.1006/JCTB.1999.1927},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Kierstead00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kierstead99,
  author       = {Hal A. Kierstead},
  title        = {The dimension of two levels of the Boolean lattice},
  journal      = {Discret. Math.},
  volume       = {201},
  number       = {1-3},
  pages        = {141--155},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00316-1},
  doi          = {10.1016/S0012-365X(98)00316-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kierstead99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KatonaK99,
  author       = {Gyula Y. Katona and
                  Hal A. Kierstead},
  title        = {Hamiltonian chains in hypergraphs},
  journal      = {J. Graph Theory},
  volume       = {30},
  number       = {3},
  pages        = {205--212},
  year         = {1999},
  url          = {https://doi.org/10.1002/(SICI)1097-0118(199903)30:3\&\#60;205::AID-JGT5\&\#62;3.0.CO;2-O},
  doi          = {10.1002/(SICI)1097-0118(199903)30:3\&\#60;205::AID-JGT5\&\#62;3.0.CO;2-O},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KatonaK99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KiersteadSS99,
  author       = {Hal A. Kierstead and
                  G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
                  Stanley M. Selkow},
  title        = {On \emph{k}-ordered Hamiltonian graphs},
  journal      = {J. Graph Theory},
  volume       = {32},
  number       = {1},
  pages        = {17--25},
  year         = {1999},
  url          = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\&\#60;17::AID-JGT2\&\#62;3.0.CO;2-G},
  doi          = {10.1002/(SICI)1097-0118(199909)32:1\&\#60;17::AID-JGT2\&\#62;3.0.CO;2-G},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KiersteadSS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadQ98,
  author       = {Hal A. Kierstead and
                  Juan Quintana},
  title        = {Square Hamiltonian cycles in graphs with maximal 4-cliques},
  journal      = {Discret. Math.},
  volume       = {178},
  number       = {1-3},
  pages        = {81--92},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)81819-5},
  doi          = {10.1016/S0012-365X(97)81819-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadQ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/Kierstead97,
  author       = {Hal A. Kierstead},
  title        = {Classes of Graphs that Are Not Vertex Ramsey},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {10},
  number       = {3},
  pages        = {373--380},
  year         = {1997},
  url          = {https://doi.org/10.1137/S0895480194264769},
  doi          = {10.1137/S0895480194264769},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Kierstead97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorica/KiersteadK96,
  author       = {Hal A. Kierstead and
                  Katalin Kolossa},
  title        = {On-Line Coloring of Perfect Graphs},
  journal      = {Comb.},
  volume       = {16},
  number       = {4},
  pages        = {479--491},
  year         = {1996},
  url          = {https://doi.org/10.1007/BF01271267},
  doi          = {10.1007/BF01271267},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KiersteadK96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadR96,
  author       = {Hal A. Kierstead and
                  Vojtech R{\"{o}}dl},
  title        = {Applications of hypergraph coloring to coloring graphs not inducing
                  certain trees},
  journal      = {Discret. Math.},
  volume       = {150},
  number       = {1-3},
  pages        = {187--193},
  year         = {1996},
  url          = {https://doi.org/10.1016/0012-365X(95)00187-2},
  doi          = {10.1016/0012-365X(95)00187-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadR96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/FanK96,
  author       = {Genghua Fan and
                  Henry A. Kierstead},
  title        = {Hamiltonian Square-Paths},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {67},
  number       = {2},
  pages        = {167--182},
  year         = {1996},
  url          = {https://doi.org/10.1006/jctb.1996.0039},
  doi          = {10.1006/JCTB.1996.0039},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/FanK96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Kierstead96,
  author       = {Hal A. Kierstead},
  title        = {On the Order Dimension of 1-Sets versus k-Sets},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {73},
  number       = {2},
  pages        = {219--228},
  year         = {1996},
  url          = {https://doi.org/10.1006/jcta.1996.0019},
  doi          = {10.1006/JCTA.1996.0019},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Kierstead96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FanK96,
  author       = {Genghua Fan and
                  Hal A. Kierstead},
  title        = {Partitioning a graph into two square-cycles},
  journal      = {J. Graph Theory},
  volume       = {23},
  number       = {3},
  pages        = {241--256},
  year         = {1996},
  url          = {https://doi.org/10.1002/(SICI)1097-0118(199611)23:3\&\#60;241::AID-JGT4\&\#62;3.0.CO;2-S},
  doi          = {10.1002/(SICI)1097-0118(199611)23:3\&\#60;241::AID-JGT4\&\#62;3.0.CO;2-S},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FanK96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/Kierstead96,
  author       = {Hal A. Kierstead},
  editor       = {Amos Fiat and
                  Gerhard J. Woeginger},
  title        = {Coloring Graphs On-line},
  booktitle    = {Online Algorithms, The State of the Art (the book grow out of a Dagstuhl
                  Seminar, June 1996)},
  series       = {Lecture Notes in Computer Science},
  volume       = {1442},
  pages        = {281--305},
  publisher    = {Springer},
  year         = {1996},
  url          = {https://doi.org/10.1007/BFb0029574},
  doi          = {10.1007/BFB0029574},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/Kierstead96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadQ95,
  author       = {Hal A. Kierstead and
                  Jun Qin},
  title        = {Coloring interval graphs with first-fit},
  journal      = {Discret. Math.},
  volume       = {144},
  number       = {1-3},
  pages        = {47--57},
  year         = {1995},
  url          = {https://doi.org/10.1016/0012-365X(94)00285-Q},
  doi          = {10.1016/0012-365X(94)00285-Q},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadQ95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/FanK95,
  author       = {Genghua Fan and
                  Henry A. Kierstead},
  title        = {The Square of Paths and Cycles},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {63},
  number       = {1},
  pages        = {55--64},
  year         = {1995},
  url          = {https://doi.org/10.1006/jctb.1995.1005},
  doi          = {10.1006/JCTB.1995.1005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/FanK95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/KiersteadPT95,
  author       = {Henry A. Kierstead and
                  Stephen G. Penrice and
                  William T. Trotter},
  title        = {On-Line and First-Fit Coloring of Graphs That Do Not Induce P\({}_{\mbox{5}}\)},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {8},
  number       = {4},
  pages        = {485--498},
  year         = {1995},
  url          = {https://doi.org/10.1137/S0895480191218861},
  doi          = {10.1137/S0895480191218861},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/KiersteadPT95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/DuffusKS94,
  author       = {D. A. Duffus and
                  Hal A. Kierstead and
                  Hunter S. Snevily},
  title        = {An Explicit 1-Factorization in the Middle of the Boolean Lattice},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {65},
  number       = {2},
  pages        = {334--342},
  year         = {1994},
  timestamp    = {Fri, 21 Jan 2005 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/DuffusKS94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KiersteadP94,
  author       = {Henry A. Kierstead and
                  Stephen G. Penrice},
  title        = {Radius two trees specify {\(\chi\)}-bounded classes},
  journal      = {J. Graph Theory},
  volume       = {18},
  number       = {2},
  pages        = {119--129},
  year         = {1994},
  url          = {https://doi.org/10.1002/jgt.3190180203},
  doi          = {10.1002/JGT.3190180203},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KiersteadP94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/KiersteadPT94,
  author       = {Henry A. Kierstead and
                  Stephen G. Penrice and
                  William T. Trotter},
  title        = {On-Line Coloring and Recursive Graph Theory},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {7},
  number       = {1},
  pages        = {72--89},
  year         = {1994},
  url          = {https://doi.org/10.1137/S0895480192224737},
  doi          = {10.1137/S0895480192224737},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/KiersteadPT94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadT92,
  author       = {Hal A. Kierstead and
                  William T. Trotter},
  title        = {Colorful induced subgraphs},
  journal      = {Discret. Math.},
  volume       = {101},
  number       = {1-3},
  pages        = {165--169},
  year         = {1992},
  url          = {https://doi.org/10.1016/0012-365X(92)90600-K},
  doi          = {10.1016/0012-365X(92)90600-K},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadT92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kierstead91,
  author       = {Hal A. Kierstead},
  title        = {A polynomial time approximation algorithm for dynamic storage allocation},
  journal      = {Discret. Math.},
  volume       = {88},
  number       = {2-3},
  pages        = {231--237},
  year         = {1991},
  url          = {https://doi.org/10.1016/0012-365X(91)90011-P},
  doi          = {10.1016/0012-365X(91)90011-P},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kierstead91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/DuffusKT91,
  author       = {Dwight Duffus and
                  Hal A. Kierstead and
                  William T. Trotter},
  title        = {Fibres and ordered set coloring},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {58},
  number       = {1},
  pages        = {158--164},
  year         = {1991},
  url          = {https://doi.org/10.1016/0097-3165(91)90083-S},
  doi          = {10.1016/0097-3165(91)90083-S},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/DuffusKT91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/ErdosKT91,
  author       = {Paul Erd{\"{o}}s and
                  Henry A. Kierstead and
                  William T. Trotter},
  title        = {The Dimension of Random Ordered Sets},
  journal      = {Random Struct. Algorithms},
  volume       = {2},
  number       = {3},
  pages        = {254--276},
  year         = {1991},
  url          = {https://doi.org/10.1002/rsa.3240020302},
  doi          = {10.1002/RSA.3240020302},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/ErdosKT91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dimacs/KiersteadT91,
  author       = {Hal A. Kierstead and
                  William T. Trotter},
  editor       = {Lyle A. McGeoch and
                  Daniel Dominic Sleator},
  title        = {On-line Graph Coloring},
  booktitle    = {On-Line Algorithms, Proceedings of a {DIMACS} Workshop, New Brunswick,
                  New Jersey, USA, February 11-13, 1991},
  series       = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume       = {7},
  pages        = {85--92},
  publisher    = {{DIMACS/AMS}},
  year         = {1991},
  url          = {https://doi.org/10.1090/dimacs/007/06},
  doi          = {10.1090/DIMACS/007/06},
  timestamp    = {Mon, 22 May 2023 16:07:35 +0200},
  biburl       = {https://dblp.org/rec/conf/dimacs/KiersteadT91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dimacs/KiersteadT91a,
  author       = {Hal A. Kierstead and
                  William T. Trotter},
  editor       = {William T. Trotter},
  title        = {Planar Graph Coloring with an Uncooperative Partner},
  booktitle    = {Planar Graphs, Proceedings of a {DIMACS} Workshop, New Brunswick,
                  New Jersey, USA, November 18-21, 1991},
  series       = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume       = {9},
  pages        = {85--93},
  publisher    = {{DIMACS/AMS}},
  year         = {1991},
  url          = {https://doi.org/10.1090/dimacs/009/08},
  doi          = {10.1090/DIMACS/009/08},
  timestamp    = {Mon, 22 May 2023 16:07:35 +0200},
  biburl       = {https://dblp.org/rec/conf/dimacs/KiersteadT91a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kierstead89,
  author       = {Hal A. Kierstead},
  title        = {Applications of edge coloring of multigraphs to vertex coloring of
                  graphs},
  journal      = {Discret. Math.},
  volume       = {74},
  number       = {1-2},
  pages        = {117--124},
  year         = {1989},
  url          = {https://doi.org/10.1016/0012-365X(89)90203-3},
  doi          = {10.1016/0012-365X(89)90203-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kierstead89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/Kierstead88,
  author       = {Hal A. Kierstead},
  title        = {The Linearity of First-Fit Coloring of Interval Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {1},
  number       = {4},
  pages        = {526--530},
  year         = {1988},
  url          = {https://doi.org/10.1137/0401048},
  doi          = {10.1137/0401048},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Kierstead88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadT87,
  author       = {Hal A. Kierstead and
                  William T. Trotter},
  title        = {A Ramsey theoretic problem for finite ordered sets},
  journal      = {Discret. Math.},
  volume       = {63},
  number       = {2-3},
  pages        = {217--223},
  year         = {1987},
  url          = {https://doi.org/10.1016/0012-365X(87)90009-4},
  doi          = {10.1016/0012-365X(87)90009-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadT87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsyml/Kierstead87,
  author       = {Henry A. Kierstead},
  title        = {On pi\({}_{\mbox{1}}\)-Automorphism of Recursive Linear Orders},
  journal      = {J. Symb. Log.},
  volume       = {52},
  number       = {3},
  pages        = {681--688},
  year         = {1987},
  url          = {https://doi.org/10.1017/S0022481200029686},
  doi          = {10.1017/S0022481200029686},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsyml/Kierstead87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadS86,
  author       = {Henry A. Kierstead and
                  James H. Schmerl},
  title        = {The chromatic number of graphs which induce neither K\({}_{\mbox{1,
                  3}}\) nor K\({}_{\mbox{5}}\)-e},
  journal      = {Discret. Math.},
  volume       = {58},
  number       = {3},
  pages        = {253--262},
  year         = {1986},
  url          = {https://doi.org/10.1016/0012-365X(86)90142-1},
  doi          = {10.1016/0012-365X(86)90142-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadS86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorica/KiersteadST84,
  author       = {Henry A. Kierstead and
                  Endre Szemer{\'{e}}di and
                  William T. Trotter},
  title        = {On coloring graphs with locally small chromatic number},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {183--185},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579219},
  doi          = {10.1007/BF02579219},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KiersteadST84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/EhrenfeuchtFK84,
  author       = {Andrzej Ehrenfeucht and
                  Vance Faber and
                  Hal A. Kierstead},
  title        = {A new method of proving theorems on chromatic index},
  journal      = {Discret. Math.},
  volume       = {52},
  number       = {2-3},
  pages        = {159--164},
  year         = {1984},
  url          = {https://doi.org/10.1016/0012-365X(84)90078-5},
  doi          = {10.1016/0012-365X(84)90078-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/EhrenfeuchtFK84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Kierstead84,
  author       = {Henry A. Kierstead},
  title        = {On the chromatic index of multigraphs without large triangles},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {36},
  number       = {2},
  pages        = {156--160},
  year         = {1984},
  url          = {https://doi.org/10.1016/0095-8956(84)90022-4},
  doi          = {10.1016/0095-8956(84)90022-4},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Kierstead84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KiersteadS83,
  author       = {Henry A. Kierstead and
                  James H. Schmerl},
  title        = {Some applications of Vizing's theorem to vertex colorings of graphs},
  journal      = {Discret. Math.},
  volume       = {45},
  number       = {2-3},
  pages        = {277--285},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90043-2},
  doi          = {10.1016/0012-365X(83)90043-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadS83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsyml/KiersteadR83,
  author       = {Henry A. Kierstead and
                  Jeffrey B. Remmel},
  title        = {Indiscernibles and Decidable Models},
  journal      = {J. Symb. Log.},
  volume       = {48},
  number       = {1},
  pages        = {21--32},
  year         = {1983},
  url          = {https://doi.org/10.2307/2273316},
  doi          = {10.2307/2273316},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsyml/KiersteadR83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

a service of

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.