Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jgt/jgt13.bht:"
download as .bib file
@article{DBLP:journals/jgt/AharoniT89,
author = {Ron Aharoni and
Carsten Thomassen},
title = {Infinite, highly connected digraphs with no two arc-disjoint spanning
trees},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {71--74},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130110},
doi = {10.1002/JGT.3190130110},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AharoniT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AkiyamaEGW89,
author = {Jin Akiyama and
Hiroshi Era and
Severino Villanueva Gervacio and
Mamoru Watanabe},
title = {Path chromatic numbers of graphs},
journal = {J. Graph Theory},
volume = {13},
number = {5},
pages = {571--573},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130506},
doi = {10.1002/JGT.3190130506},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AkiyamaEGW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AlonS89,
author = {Noga Alon and
Paul D. Seymour},
title = {A counterexample to the rank-coloring conjecture},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {523--525},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130413},
doi = {10.1002/JGT.3190130413},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AlonS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AmarFG89,
author = {Denise Amar and
Ir{\`{e}}ne Fournier and
Anne Germa},
title = {Covering the vertices of a graph by cycles of prescribed length},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {323--330},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130307},
doi = {10.1002/JGT.3190130307},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AmarFG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Aung89,
author = {Min Aung},
title = {Circumference of a regular graph},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {149--155},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130203},
doi = {10.1002/JGT.3190130203},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Aung89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bandelt89,
author = {Hans{-}J{\"{u}}rgen Bandelt},
title = {Graphs with intrinsic s\({}_{\mbox{3}}\) convexities},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {215--228},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130208},
doi = {10.1002/JGT.3190130208},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Bandelt89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BeaneBW89,
author = {Donald G. Beane and
Norman L. Biggs and
Brian J. Wilson},
title = {The growth rate of the harmonious chromatic number},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {291--299},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130304},
doi = {10.1002/JGT.3190130304},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BeaneBW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BlokhuisB89,
author = {Aart Blokhuis and
Andries E. Brouwer},
title = {Locally 4-by-4 grid graphs},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {229--244},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130209},
doi = {10.1002/JGT.3190130209},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BlokhuisB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrewsterCM89,
author = {Richard C. Brewster and
Ernest J. Cockayne and
Christina M. Mynhardt},
title = {Irredundant ramsey numbers for graphs},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {283--290},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130303},
doi = {10.1002/JGT.3190130303},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrewsterCM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrinRS89,
author = {Matthew G. Brin and
David E. Rauschenberg and
Craig C. Squier},
title = {On the genus of the semidirect product of {\(\mathbb{Z}\)}\({}_{\mbox{9}}\)
by {\(\mathbb{Z}\)}\({}_{\mbox{3}}\)},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {49--61},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130108},
doi = {10.1002/JGT.3190130108},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrinRS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroereB89,
author = {Izak Broere and
Marieta Burger},
title = {Critically cochromatic graphs},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {23--28},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130106},
doi = {10.1002/JGT.3190130106},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroereB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaH89,
author = {Haitze J. Broersma and
Cornelis Hoede},
title = {Path graphs},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {427--444},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130406},
doi = {10.1002/JGT.3190130406},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BurrEGS89,
author = {Stefan A. Burr and
Paul Erd{\"{o}}s and
Ronald L. Graham and
Vera T. S{\'{o}}s},
title = {Maximal antiramsey graphs and the strong chromatic number},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {263--282},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130302},
doi = {10.1002/JGT.3190130302},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BurrEGS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Cai89,
author = {Mao{-}cheng Cai},
title = {Common root functions of two digraphs},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {249--256},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130211},
doi = {10.1002/JGT.3190130211},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Cai89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Catlin89,
author = {Paul A. Catlin},
title = {Double cycle covers and the petersen graph},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {465--483},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130408},
doi = {10.1002/JGT.3190130408},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Catlin89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChetwyndH89,
author = {Amanda G. Chetwynd and
Roland H{\"{a}}ggkvist},
title = {A note on list-colorings},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {87--95},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130112},
doi = {10.1002/JGT.3190130112},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChetwyndH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ClaphamEHMS89,
author = {C. R. J. Clapham and
Geoffrey Exoo and
Heiko Harborth and
Ingrid Mengersen and
J. Sheehan},
title = {The ramsey number of k\({}_{\mbox{5}}\) - e},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {7--15},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130104},
doi = {10.1002/JGT.3190130104},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ClaphamEHMS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ClaphamFS89,
author = {C. R. J. Clapham and
A. Flockhart and
J. Sheehan},
title = {Graphs without four-cycles},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {29--47},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130107},
doi = {10.1002/JGT.3190130107},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ClaphamFS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CooperF89,
author = {Colin Cooper and
Alan M. Frieze},
title = {On the number of hamilton cycles in a random graph},
journal = {J. Graph Theory},
volume = {13},
number = {6},
pages = {719--735},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130608},
doi = {10.1002/JGT.3190130608},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CooperF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DasSRW89,
author = {Sandip Das and
Malay K. Sen and
A. B. Roy and
Douglas B. West},
title = {Interval digraphs: An analogue of interval graphs},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {189--202},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130206},
doi = {10.1002/JGT.3190130206},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/DasSRW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DeanF89,
author = {Nathaniel Dean and
Pierre Fraisse},
title = {A degree condition for the circumference of a graph},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {331--334},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130308},
doi = {10.1002/JGT.3190130308},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DeanF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DeanHO89,
author = {Nathaniel Dean and
Robert L. Hemminger and
Katsuhiro Ota},
title = {Longest cycles in 3-connected graphs contain three contractible edges},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {17--21},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130105},
doi = {10.1002/JGT.3190130105},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DeanHO89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DinitzS89,
author = {Jeffrey H. Dinitz and
Douglas R. Stinson},
title = {Some new perfect one-factorizations from starters in finite fields},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {405--415},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130404},
doi = {10.1002/JGT.3190130404},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DinitzS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ErdosE89,
author = {Paul Erd{\"{o}}s and
Anthony B. Evans},
title = {Representations of graphs and orthogonal latin square graphs},
journal = {J. Graph Theory},
volume = {13},
number = {5},
pages = {593--595},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130509},
doi = {10.1002/JGT.3190130509},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ErdosE89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ErdosFGS89,
author = {Paul Erd{\"{o}}s and
Ralph J. Faudree and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Richard H. Schelp},
title = {Domination in colored complete graphs},
journal = {J. Graph Theory},
volume = {13},
number = {6},
pages = {713--718},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130607},
doi = {10.1002/JGT.3190130607},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ErdosFGS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Exoo89,
author = {Geoffrey Exoo},
title = {A lower bound for r(5, 5)},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {97--98},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130113},
doi = {10.1002/JGT.3190130113},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Exoo89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FabregaF89,
author = {Josep F{\`{a}}brega and
Miguel Angel Fiol},
title = {Maximally connected digraphs},
journal = {J. Graph Theory},
volume = {13},
number = {6},
pages = {657--668},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130603},
doi = {10.1002/JGT.3190130603},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FabregaF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Fassbender89,
author = {Bert Fassbender},
title = {On longest cycles and strongly linking vertex sets},
journal = {J. Graph Theory},
volume = {13},
number = {6},
pages = {697--702},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130605},
doi = {10.1002/JGT.3190130605},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Fassbender89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Fisher89,
author = {David C. Fisher},
title = {Lower bounds on the number of triangles in a graph},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {505--512},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130411},
doi = {10.1002/JGT.3190130411},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Fisher89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Gallian89,
author = {Joseph A. Gallian},
title = {A survey: Recent results, conjectures, and open problems in labeling
graphs},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {491--504},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130410},
doi = {10.1002/JGT.3190130410},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Gallian89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GriggsKS89,
author = {Jerrold R. Griggs and
Daniel J. Kleitman and
Aditya Shastri},
title = {Spanning trees with many leaves in cubic graphs},
journal = {J. Graph Theory},
volume = {13},
number = {6},
pages = {669--695},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130604},
doi = {10.1002/JGT.3190130604},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GriggsKS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hao89,
author = {Li Hao},
title = {Edge disjoint cycles in graphs},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {313--322},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130306},
doi = {10.1002/JGT.3190130306},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hao89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HararyP89,
author = {Frank Harary and
Michael Plantholt},
title = {Classification of interpolation theorems for spanning trees and other
families of spanning subgraphs},
journal = {J. Graph Theory},
volume = {13},
number = {6},
pages = {703--712},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130606},
doi = {10.1002/JGT.3190130606},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HararyP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HartvigsenZ89,
author = {David Hartvigsen and
Eitan Zemel},
title = {Is every cycle basis fundamental?},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {117--137},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130115},
doi = {10.1002/JGT.3190130115},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HartvigsenZ89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hendry89,
author = {George R. T. Hendry},
title = {Ramsey numbers for graphs with five vertices},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {245--248},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130210},
doi = {10.1002/JGT.3190130210},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hendry89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hendry89a,
author = {George R. T. Hendry},
title = {A strengthening of Kikustapos;s theorem},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {257--260},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130212},
doi = {10.1002/JGT.3190130212},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hendry89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HoangR89,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Bruce A. Reed},
title = {Some classes of perfectly orderable graphs},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {445--463},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130407},
doi = {10.1002/JGT.3190130407},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HoangR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HoffmanLR89,
author = {Dean G. Hoffman and
Charles Curtis Lindner and
Christopher A. Rodger},
title = {On the construction of odd cycle systems},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {417--426},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130405},
doi = {10.1002/JGT.3190130405},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HoffmanLR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JacksonW89,
author = {Bill Jackson and
Robin W. Whitty},
title = {A note concerning graphs with unique f-factors},
journal = {J. Graph Theory},
volume = {13},
number = {5},
pages = {577--580},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130507},
doi = {10.1002/JGT.3190130507},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JacksonW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jorgensen89,
author = {Leif K. J{\o}rgensen},
title = {Some probabilistic and extremal results on subdivisions and odd subdivisions
of graphs},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {75--85},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130111},
doi = {10.1002/JGT.3190130111},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Jorgensen89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KohT89,
author = {Khee Meng Koh and
Kee L. Teo},
title = {The 2-hamiltonian cubes of graphs},
journal = {J. Graph Theory},
volume = {13},
number = {6},
pages = {737--747},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130609},
doi = {10.1002/JGT.3190130609},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KohT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lazebnik89,
author = {Felix Lazebnik},
title = {On the greatest number of 2 and 3 colorings of a (v, e)-graph},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {203--214},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130207},
doi = {10.1002/JGT.3190130207},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Lazebnik89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lehel89,
author = {Jen{\"{o}} Lehel},
title = {The minimum number of triangles covering the edges of a graph},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {369--384},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130312},
doi = {10.1002/JGT.3190130312},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Lehel89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lindquester89,
author = {Terri Lindquester},
title = {The effects of distance and neighborhood union conditions on hamiltonian
properties in graphs},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {335--352},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130309},
doi = {10.1002/JGT.3190130309},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Lindquester89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lonc89,
author = {Zbigniew Lonc},
title = {Decompositions of graphs into trees},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {393--403},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130403},
doi = {10.1002/JGT.3190130403},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/Lonc89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lorimer89,
author = {Peter J. Lorimer},
title = {The construction of tutte's 8-cage and the conder graph},
journal = {J. Graph Theory},
volume = {13},
number = {5},
pages = {553--557},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130504},
doi = {10.1002/JGT.3190130504},
timestamp = {Mon, 21 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/Lorimer89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Mader89,
author = {Wolfgang Mader},
title = {On critically connected digraphs},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {513--522},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130412},
doi = {10.1002/JGT.3190130412},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Mader89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ManolisY89,
author = {Manoussakis Manolis and
Yannis Manoussakis},
title = {The number of bipartite tournaments with a unique given factor},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {359--368},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130311},
doi = {10.1002/JGT.3190130311},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ManolisY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/McCuaigS89,
author = {William McCuaig and
F. Bruce Shepherd},
title = {Domination in graphs with minimum degree two},
journal = {J. Graph Theory},
volume = {13},
number = {6},
pages = {749--762},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130610},
doi = {10.1002/JGT.3190130610},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/McCuaigS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Moshi89,
author = {Augustine M. Moshi},
title = {Matching cutsets in graphs},
journal = {J. Graph Theory},
volume = {13},
number = {5},
pages = {527--536},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130502},
doi = {10.1002/JGT.3190130502},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Moshi89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Nishimura89,
author = {Tsuyoshi Nishimura},
title = {Independence number, connectivity, and r-factors},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {63--69},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130109},
doi = {10.1002/JGT.3190130109},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Nishimura89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Olariu89,
author = {Stephan Olariu},
title = {A decomposition for strongly perfect graphs},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {301--311},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130305},
doi = {10.1002/JGT.3190130305},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Olariu89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/PelegS89,
author = {David Peleg and
Alejandro A. Sch{\"{a}}ffer},
title = {Graph spanners},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {99--116},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130114},
doi = {10.1002/JGT.3190130114},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/PelegS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Sabidussi89,
author = {Gert Sabidussi},
title = {Paths in bipartite graphs with color-inverting involutions},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {157--174},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130204},
doi = {10.1002/JGT.3190130204},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Sabidussi89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SenDW89,
author = {Malay K. Sen and
Sandip Das and
Douglas B. West},
title = {Circular-arc digraphs: {A} characterization},
journal = {J. Graph Theory},
volume = {13},
number = {5},
pages = {581--592},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130508},
doi = {10.1002/JGT.3190130508},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/SenDW89.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}
}
@article{DBLP:journals/jgt/ThomassenEAMS89,
author = {Carsten Thomassen and
Paul Erd{\"{o}}s and
Yousef Alavi and
Paresh J. Malde and
Allen J. Schwenk},
title = {Tight bounds on the chromatic sum of a connected graph},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {353--357},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130310},
doi = {10.1002/JGT.3190130310},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ThomassenEAMS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Tokushige89,
author = {Norihide Tokushige},
title = {Binding number and minimum degree for k-factors},
journal = {J. Graph Theory},
volume = {13},
number = {5},
pages = {607--617},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130511},
doi = {10.1002/JGT.3190130511},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Tokushige89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Truemper89,
author = {Klaus Truemper},
title = {On the delta-wye reduction for planar graphs},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {141--148},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130202},
doi = {10.1002/JGT.3190130202},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Truemper89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Volkmann89,
author = {Lutz Volkmann},
title = {Edge-connectivity in p-partite graphs},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {1--6},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130103},
doi = {10.1002/JGT.3190130103},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Volkmann89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wanner89,
author = {Thomas Wanner},
title = {On the chromaticity of certain subgraphs of a q-tree},
journal = {J. Graph Theory},
volume = {13},
number = {5},
pages = {597--605},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130510},
doi = {10.1002/JGT.3190130510},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wanner89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Whitehead89,
author = {Carol A. Whitehead},
title = {Alternating cycles in edge-colored graphs},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {387--391},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130402},
doi = {10.1002/JGT.3190130402},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Whitehead89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Yamada89,
author = {Shuji Yamada},
title = {An invariant of spatial graphs},
journal = {J. Graph Theory},
volume = {13},
number = {5},
pages = {537--551},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130503},
doi = {10.1002/JGT.3190130503},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Yamada89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ZehaviI89,
author = {Avram Zehavi and
Alon Itai},
title = {Three tree-paths},
journal = {J. Graph Theory},
volume = {13},
number = {2},
pages = {175--188},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130205},
doi = {10.1002/JGT.3190130205},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ZehaviI89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Zhang89,
author = {Cun{-}Quan Zhang},
title = {Circumference and girth},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {485--490},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130409},
doi = {10.1002/JGT.3190130409},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Zhang89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Zhou89,
author = {Huai{-}Lu Zhou},
title = {A necessary and sufficient condition for connected, locally k-connected
k\({}_{\mbox{1, 3}}\)-free graphs to be k-hamiltonian},
journal = {J. Graph Theory},
volume = {13},
number = {6},
pages = {651--656},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130602},
doi = {10.1002/JGT.3190130602},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Zhou89.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.
retrieved on 2024-04-20 05:56 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
