Search dblp for Publications

export results for "toc:db/journals/jgt/jgt91.bht:"

 download as .bib file

@article{DBLP:journals/jgt/AngelB19,
  author       = {Andr{\'{e}}s {\'{A}}ngel and
                  Jerson Borja},
  title        = {The evasiveness conjecture and graphs on 2p vertices},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {1},
  pages        = {35--52},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22419},
  doi          = {10.1002/JGT.22419},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/AngelB19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BasteRS19,
  author       = {Julien Baste and
                  Dieter Rautenbach and
                  Ignasi Sau},
  title        = {Upper bounds on the uniquely restricted chromatic index},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {3},
  pages        = {251--258},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22429},
  doi          = {10.1002/JGT.22429},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BasteRS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BessyOR19,
  author       = {St{\'{e}}phane Bessy and
                  Pascal Ochem and
                  Dieter Rautenbach},
  title        = {On the K{\H{o}}nig?Egerv{\'{a}}ry theorem for k?paths},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {1},
  pages        = {73--87},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22421},
  doi          = {10.1002/JGT.22421},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BessyOR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BlancheD0P19,
  author       = {Alexandre Blanch{\'{e}} and
                  Konrad K. Dabrowski and
                  Matthew Johnson and
                  Dani{\"{e}}l Paulusma},
  title        = {Hereditary graph classes: When the complexities of coloring and clique
                  cover coincide},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {3},
  pages        = {267--289},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22431},
  doi          = {10.1002/JGT.22431},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BlancheD0P19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BoncompagniPV19,
  author       = {Valerio Boncompagni and
                  Irena Penev and
                  Kristina Vuskovic},
  title        = {Clique-cutsets beyond chordal graphs},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {2},
  pages        = {192--246},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22428},
  doi          = {10.1002/JGT.22428},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BoncompagniPV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BustamanteHS19,
  author       = {Sebasti{\'{a}}n Bustamante and
                  Hi{\^{e}}p H{\`{a}}n and
                  Maya Stein},
  title        = {Almost partitioning 2?colored complete 3?uniform hypergraphs into
                  two monochromatic tight or loose cycles},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {1},
  pages        = {5--15},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22417},
  doi          = {10.1002/JGT.22417},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/BustamanteHS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ChaplickFK19,
  author       = {Steven Chaplick and
                  Radoslav Fulek and
                  Pavel Klav{\'{\i}}k},
  title        = {Extending partial representations of circle graphs},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {4},
  pages        = {365--394},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22436},
  doi          = {10.1002/JGT.22436},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/ChaplickFK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ChoiE19,
  author       = {Ilkyoo Choi and
                  Louis Esperet},
  title        = {Improper coloring of graphs on surfaces},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {1},
  pages        = {16--34},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22418},
  doi          = {10.1002/JGT.22418},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/ChoiE19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ClemensJKMMRR19,
  author       = {Dennis Clemens and
                  Matthew Jenssen and
                  Yoshiharu Kohayakawa and
                  Natasha Morrison and
                  Guilherme Oliveira Mota and
                  Damian Reding and
                  Barnaby Roberts},
  title        = {The size?Ramsey number of powers of paths},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {3},
  pages        = {290--299},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22432},
  doi          = {10.1002/JGT.22432},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/ClemensJKMMRR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Dvorak19,
  author       = {Zdenek Dvor{\'{a}}k},
  title        = {On distance r?dominating and 2r?independent sets in sparse graphs},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {2},
  pages        = {162--173},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22426},
  doi          = {10.1002/JGT.22426},
  timestamp    = {Fri, 01 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/Dvorak19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GerbnerKMPV19,
  author       = {D{\'{a}}niel Gerbner and
                  Bal{\'{a}}zs Keszegh and
                  Abhishek Methuku and
                  Bal{\'{a}}zs Patk{\'{o}}s and
                  M{\'{a}}t{\'{e}} Vizer},
  title        = {An improvement on the maximum number of k?dominating independent sets},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {1},
  pages        = {88--97},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22422},
  doi          = {10.1002/JGT.22422},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/GerbnerKMPV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GevigneyS19,
  author       = {Olivier Durand de Gevigney and
                  Zolt{\'{a}}n Szigeti},
  title        = {On (2, k)?connected graphs},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {4},
  pages        = {305--325},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22433},
  doi          = {10.1002/JGT.22433},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/GevigneyS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GiraoLS19,
  author       = {Ant{\'{o}}nio Gir{\~{a}}o and
                  Shoham Letzter and
                  Julian Sahasrabudhe},
  title        = {Partitioning a graph into monochromatic connected subgraphs},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {4},
  pages        = {353--364},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22435},
  doi          = {10.1002/JGT.22435},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/GiraoLS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/IlleW19,
  author       = {Pierre Ille and
                  Robert E. Woodrow},
  title        = {Fractal graphs},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {1},
  pages        = {53--72},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22420},
  doi          = {10.1002/JGT.22420},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/IlleW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KimO19,
  author       = {Seog{-}Jin Kim and
                  Kenta Ozeki},
  title        = {A note on a Brooks' type theorem for DP?coloring},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {2},
  pages        = {148--161},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22425},
  doi          = {10.1002/JGT.22425},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/KimO19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Litjens19,
  author       = {Bart Litjens},
  title        = {On dihedral flows in embedded graphs},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {2},
  pages        = {174--191},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22427},
  doi          = {10.1002/JGT.22427},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Litjens19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/MolO19,
  author       = {Lucas Mol and
                  Ortrud R. Oellermann},
  title        = {Maximizing the mean subtree order},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {4},
  pages        = {326--352},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22434},
  doi          = {10.1002/JGT.22434},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/MolO19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/SchaudtS19,
  author       = {Oliver Schaudt and
                  Maya Stein},
  title        = {Partitioning two?coloured complete multipartite graphs into monochromatic
                  paths and cycles},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {2},
  pages        = {122--147},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22424},
  doi          = {10.1002/JGT.22424},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/SchaudtS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/WollanW19,
  author       = {Paul Wollan and
                  David R. Wood},
  title        = {Nonrepetitive colorings of graphs excluding a fixed immersion or topological
                  minor},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {3},
  pages        = {259--266},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22430},
  doi          = {10.1002/JGT.22430},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/WollanW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Woodall19,
  author       = {Douglas R. Woodall},
  title        = {The average degree of a subcubic edge?chromatic critical graph},
  journal      = {J. Graph Theory},
  volume       = {91},
  number       = {2},
  pages        = {103--121},
  year         = {2019},
  url          = {https://doi.org/10.1002/jgt.22423},
  doi          = {10.1002/JGT.22423},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/Woodall19.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.