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/jgt36.bht:"
download as .bib file
@article{DBLP:journals/jgt/AlbertsonH01,
author = {Michael O. Albertson and
Joan P. Hutchinson},
title = {Extending colorings of locally planar graphs},
journal = {J. Graph Theory},
volume = {36},
number = {2},
pages = {105--116},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200102)36:2\<105::AID-JGT5\>3.0.CO;2-H},
doi = {10.1002/1097-0118(200102)36:2\<105::AID-JGT5\>3.0.CO;2-H},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AlbertsonH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ArchdeaconB01,
author = {Dan Archdeacon and
C. Paul Bonnington},
title = {Two maps on one surface},
journal = {J. Graph Theory},
volume = {36},
number = {4},
pages = {198--216},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200104)36:4\<198::AID-JGT1006\>3.0.CO;2-H},
doi = {10.1002/1097-0118(200104)36:4\<198::AID-JGT1006\>3.0.CO;2-H},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ArchdeaconB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AxenovichF01,
author = {Maria Axenovich and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Embedding of graphs in two-irregular graphs},
journal = {J. Graph Theory},
volume = {36},
number = {2},
pages = {75--83},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200102)36:2\<75::AID-JGT3\>3.0.CO;2-E},
doi = {10.1002/1097-0118(200102)36:2\<75::AID-JGT3\>3.0.CO;2-E},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AxenovichF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BryantEE01,
author = {Darryn E. Bryant and
Saad I. El{-}Zanati and
Charles Vanden Eynden},
title = {Star factorizations of graph products},
journal = {J. Graph Theory},
volume = {36},
number = {2},
pages = {59--66},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200102)36:2\<59::AID-JGT1\>3.0.CO;2-A},
doi = {10.1002/1097-0118(200102)36:2\<59::AID-JGT1\>3.0.CO;2-A},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BryantEE01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaiZ01,
author = {Leizhen Cai and
Xuding Zhu},
title = {Game chromatic index of \emph{k}-degenerate graphs},
journal = {J. Graph Theory},
volume = {36},
number = {3},
pages = {144--155},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200103)36:3\<144::AID-JGT1002\>3.0.CO;2-F},
doi = {10.1002/1097-0118(200103)36:3\<144::AID-JGT1002\>3.0.CO;2-F},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CaiZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChartrandERZ01,
author = {Gary Chartrand and
David Erwin and
Michael E. Raines and
Ping Zhang},
title = {Orientation distance graphs},
journal = {J. Graph Theory},
volume = {36},
number = {4},
pages = {230--241},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200104)36:4\<230::AID-JGT1008\>3.0.CO;2-\%23},
doi = {10.1002/1097-0118(200104)36:4\<230::AID-JGT1008\>3.0.CO;2-\%23},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChartrandERZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Garcia-MorenoS01,
author = {Enrique Garc{\'{\i}}a{-}Moreno and
Gelasio Salazar},
title = {Bounding the crossing number of a graph in terms of the crossing number
of a minor with small maximum degree},
journal = {J. Graph Theory},
volume = {36},
number = {3},
pages = {168--173},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200103)36:3\<168::AID-JGT1004\>3.0.CO;2-\%23},
doi = {10.1002/1097-0118(200103)36:3\<168::AID-JGT1004\>3.0.CO;2-\%23},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Garcia-MorenoS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HarantVJRRS01,
author = {Jochen Harant and
Margit Voigt and
Stanislav Jendrol' and
Bert Randerath and
Zdenek Ryj{\'{a}}cek and
Ingo Schiermeyer},
title = {On weights of induced paths and cycles in claw-free and \emph{K}\({}_{\mbox{1}}\)\({}_{\mbox{\emph{,
r}}}\)-free graphs},
journal = {J. Graph Theory},
volume = {36},
number = {3},
pages = {131--143},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200103)36:3\<131::AID-JGT1001\>3.0.CO;2-O},
doi = {10.1002/1097-0118(200103)36:3\<131::AID-JGT1001\>3.0.CO;2-O},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HarantVJRRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Haxell01,
author = {Penny E. Haxell},
title = {Tree embeddings},
journal = {J. Graph Theory},
volume = {36},
number = {3},
pages = {121--130},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200103)36:3\<121::AID-JGT1000\>3.0.CO;2-U},
doi = {10.1002/1097-0118(200103)36:3\<121::AID-JGT1000\>3.0.CO;2-U},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Haxell01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KanekoKN01,
author = {Atsushi Kaneko and
Alexander K. Kelmans and
Tsuyoshi Nishimura},
title = {On packing 3-vertex paths in a graph},
journal = {J. Graph Theory},
volume = {36},
number = {4},
pages = {175--197},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200104)36:4\<175::AID-JGT1005\>3.0.CO;2-T},
doi = {10.1002/1097-0118(200104)36:4\<175::AID-JGT1005\>3.0.CO;2-T},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KanekoKN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell01,
author = {Matthias Kriesell},
title = {The symmetric (2\emph{k, k})-graphs},
journal = {J. Graph Theory},
volume = {36},
number = {1},
pages = {35--51},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200101)36:1\<35::AID-JGT4\>3.0.CO;2-J},
doi = {10.1002/1097-0118(200101)36:1\<35::AID-JGT4\>3.0.CO;2-J},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell01a,
author = {Matthias Kriesell},
title = {Induced paths in 5-connected graphs},
journal = {J. Graph Theory},
volume = {36},
number = {1},
pages = {52--58},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200101)36:1\<52::AID-JGT5\>3.0.CO;2-N},
doi = {10.1002/1097-0118(200101)36:1\<52::AID-JGT5\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kuhn01,
author = {Daniela K{\"{u}}hn},
title = {Minor-universal planar graphs without accumulation points},
journal = {J. Graph Theory},
volume = {36},
number = {1},
pages = {1--7},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200101)36:1\<1::AID-JGT1\>3.0.CO;2-B},
doi = {10.1002/1097-0118(200101)36:1\<1::AID-JGT1\>3.0.CO;2-B},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kuhn01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/McGeeR01,
author = {J. W. McGee and
Christopher A. Rodger},
title = {Path coverings with paths},
journal = {J. Graph Theory},
volume = {36},
number = {3},
pages = {156--167},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200103)36:3\<156::AID-JGT1003\>3.0.CO;2-7},
doi = {10.1002/1097-0118(200103)36:3\<156::AID-JGT1003\>3.0.CO;2-7},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/McGeeR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Negami01,
author = {Seiya Negami},
title = {Crossing numbers of graph embedding pairs on closed surfaces},
journal = {J. Graph Theory},
volume = {36},
number = {1},
pages = {8--23},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200101)36:1\<8::AID-JGT2\>3.0.CO;2-O},
doi = {10.1002/1097-0118(200101)36:1\<8::AID-JGT2\>3.0.CO;2-O},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Negami01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SandersZ01,
author = {Daniel P. Sanders and
Yue Zhao},
title = {On spanning trees and walks of low maximum degree},
journal = {J. Graph Theory},
volume = {36},
number = {2},
pages = {67--74},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200102)36:2\<67::AID-JGT2\>3.0.CO;2-C},
doi = {10.1002/1097-0118(200102)36:2\<67::AID-JGT2\>3.0.CO;2-C},
timestamp = {Tue, 23 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SandersZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Stacho01,
author = {Ladislav Stacho},
title = {New upper bounds for the chromatic number of a graph},
journal = {J. Graph Theory},
volume = {36},
number = {2},
pages = {117--120},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200102)36:2\<117::AID-JGT6\>3.0.CO;2-7},
doi = {10.1002/1097-0118(200102)36:2\<117::AID-JGT6\>3.0.CO;2-7},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Stacho01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Steffen01,
author = {Eckhard Steffen},
title = {Circular flow numbers of regular multigraphs},
journal = {J. Graph Theory},
volume = {36},
number = {1},
pages = {24--34},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200101)36:1\<24::AID-JGT3\>3.0.CO;2-Q},
doi = {10.1002/1097-0118(200101)36:1\<24::AID-JGT3\>3.0.CO;2-Q},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Steffen01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/TewesV01,
author = {Meike Tewes and
Lutz Volkmann},
title = {Vertex pancyclic in-tournaments},
journal = {J. Graph Theory},
volume = {36},
number = {2},
pages = {84--104},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200102)36:2\<84::AID-JGT4\>3.0.CO;2-D},
doi = {10.1002/1097-0118(200102)36:2\<84::AID-JGT4\>3.0.CO;2-D},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/TewesV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/TuzaV01,
author = {Zsolt Tuza and
Margit Voigt},
title = {Oriented list colorings of graphs},
journal = {J. Graph Theory},
volume = {36},
number = {4},
pages = {217--229},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200104)36:4\<217::AID-JGT1007\>3.0.CO;2-1},
doi = {10.1002/1097-0118(200104)36:4\<217::AID-JGT1007\>3.0.CO;2-1},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/TuzaV01.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-08-22 23:18 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:
