default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jgt/jgt26.bht:"
download as .bib file
@article{DBLP:journals/jgt/AldredEHJ97,
author = {Robert E. L. Aldred and
Mark N. Ellingham and
Robert L. Hemminger and
Peter Jipsen},
title = {\emph{P}\({}_{\mbox{3}}\)-isomorphisms for graphs},
journal = {J. Graph Theory},
volume = {26},
number = {1},
pages = {35--51},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199709)26:1\<35::AID-JGT5\>3.0.CO;2-I},
doi = {10.1002/(SICI)1097-0118(199709)26:1\<35::AID-JGT5\>3.0.CO;2-I},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AldredEHJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BollobasT97,
author = {B{\'{e}}la Bollob{\'{a}}s and
Andrew Thomason},
title = {On the girth of hamiltonian weakly pancyclic graphs},
journal = {J. Graph Theory},
volume = {26},
number = {3},
pages = {165--173},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199711)26:3\<165::AID-JGT7\>3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199711)26:3\<165::AID-JGT7\>3.0.CO;2-P},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BollobasT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BorodinKW97,
author = {Oleg V. Borodin and
Alexandr V. Kostochka and
Douglas R. Woodall},
title = {Total colorings of planar graphs with large maximum degree},
journal = {J. Graph Theory},
volume = {26},
number = {1},
pages = {53--59},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199709)26:1\<53::AID-JGT6\>3.0.CO;2-G},
doi = {10.1002/(SICI)1097-0118(199709)26:1\<53::AID-JGT6\>3.0.CO;2-G},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BorodinKW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BurrisS97,
author = {Anita C. Burris and
Richard H. Schelp},
title = {Vertex-distinguishing proper edge-colorings},
journal = {J. Graph Theory},
volume = {26},
number = {2},
pages = {73--82},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199710)26:2\<73::AID-JGT2\>3.0.CO;2-C},
doi = {10.1002/(SICI)1097-0118(199710)26:2\<73::AID-JGT2\>3.0.CO;2-C},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BurrisS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CairnieE97,
author = {Niall Cairnie and
Keith Edwards},
title = {Some results on the achromatic number},
journal = {J. Graph Theory},
volume = {26},
number = {3},
pages = {129--136},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199711)26:3\<129::AID-JGT3\>3.0.CO;2-T},
doi = {10.1002/(SICI)1097-0118(199711)26:3\<129::AID-JGT3\>3.0.CO;2-T},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CairnieE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CameronE97,
author = {Kathie Cameron and
Jack Edmonds},
title = {Lambda composition},
journal = {J. Graph Theory},
volume = {26},
number = {1},
pages = {9--16},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199709)26:1\<9::AID-JGT2\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199709)26:1\<9::AID-JGT2\>3.0.CO;2-N},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CameronE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CherlinST97,
author = {Gregory L. Cherlin and
Niandong Shi and
Lasse Tallgren},
title = {Graphs omitting a bushy tree},
journal = {J. Graph Theory},
volume = {26},
number = {4},
pages = {203--210},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199712)26:4\<203::AID-JGT4\>3.0.CO;2-U},
doi = {10.1002/(SICI)1097-0118(199712)26:4\<203::AID-JGT4\>3.0.CO;2-U},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CherlinST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DankelmannV97,
author = {Peter Dankelmann and
Lutz Volkmann},
title = {Degree sequence conditions for maximally edge-connected graphs and
digraphs},
journal = {J. Graph Theory},
volume = {26},
number = {1},
pages = {27--34},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199709)26:1\<27::AID-JGT4\>3.0.CO;2-J},
doi = {10.1002/(SICI)1097-0118(199709)26:1\<27::AID-JGT4\>3.0.CO;2-J},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DankelmannV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DejterFMR97,
author = {Italo J. Dejter and
Frantisek Franek and
Eric Mendelsohn and
Alexander Rosa},
title = {Triangles in 2-factorizations},
journal = {J. Graph Theory},
volume = {26},
number = {2},
pages = {83--94},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199710)26:2\<83::AID-JGT3\>3.0.CO;2-B},
doi = {10.1002/(SICI)1097-0118(199710)26:2\<83::AID-JGT3\>3.0.CO;2-B},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DejterFMR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/El-Zahar97,
author = {Mohamed H. El{-}Zahar},
title = {A graph-theoretic version of the union-closed sets conjecture},
journal = {J. Graph Theory},
volume = {26},
number = {3},
pages = {155--163},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199711)26:3\<155::AID-JGT6\>3.0.CO;2-Q},
doi = {10.1002/(SICI)1097-0118(199711)26:3\<155::AID-JGT6\>3.0.CO;2-Q},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/El-Zahar97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FishburnW97,
author = {Peter C. Fishburn and
Paul E. Wright},
title = {Bandwidth edge counts for linear arrangements of rectangular grids},
journal = {J. Graph Theory},
volume = {26},
number = {4},
pages = {195--202},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199712)26:4\<195::AID-JGT3\>3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0118(199712)26:4\<195::AID-JGT3\>3.0.CO;2-L},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FishburnW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FraughnaughL97,
author = {Kathryn Fraughnaugh and
Stephen C. Locke},
title = {Lower bounds on size and independence in \emph{K}\({}_{\mbox{4}}\)-free
graphs},
journal = {J. Graph Theory},
volume = {26},
number = {2},
pages = {61--71},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199710)26:2\<61::AID-JGT1\>3.0.CO;2-D},
doi = {10.1002/(SICI)1097-0118(199710)26:2\<61::AID-JGT1\>3.0.CO;2-D},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FraughnaughL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HiltonZ97,
author = {Anthony J. W. Hilton and
C. Zhao},
title = {Coloring graphs which have equibipartite complements},
journal = {J. Graph Theory},
volume = {26},
number = {4},
pages = {183--194},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199712)26:4\<183::AID-JGT2\>3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0118(199712)26:4\<183::AID-JGT2\>3.0.CO;2-M},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HiltonZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JohnsonHS97,
author = {A. Johnson and
Fred C. Holroyd and
S. Stahl},
title = {Multichromatic numbers, star chromatic numbers and Kneser graphs},
journal = {J. Graph Theory},
volume = {26},
number = {3},
pages = {137--145},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199711)26:3\<137::AID-JGT4\>3.0.CO;2-S},
doi = {10.1002/(SICI)1097-0118(199711)26:3\<137::AID-JGT4\>3.0.CO;2-S},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JohnsonHS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kotlov97,
author = {Andrei Kotlov},
title = {Rank and chromatic number of a graph},
journal = {J. Graph Theory},
volume = {26},
number = {1},
pages = {1--8},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199709)26:1\<1::AID-JGT1\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199709)26:1\<1::AID-JGT1\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kotlov97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LazebnikW97,
author = {Felix Lazebnik and
Ping Wang},
title = {On the structure of extremal graphs of high girth},
journal = {J. Graph Theory},
volume = {26},
number = {3},
pages = {147--153},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199711)26:3\<147::AID-JGT5\>3.0.CO;2-R},
doi = {10.1002/(SICI)1097-0118(199711)26:3\<147::AID-JGT5\>3.0.CO;2-R},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LazebnikW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Polat97,
author = {Norbert Polat},
title = {End-faithful spanning trees in \emph{T}\({}_{\mbox{1}}\)-free graphs},
journal = {J. Graph Theory},
volume = {26},
number = {4},
pages = {175--181},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199712)26:4\<175::AID-JGT1\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199712)26:4\<175::AID-JGT1\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Polat97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Soltes97,
author = {Lubom{\'{\i}}r Solt{\'{e}}s},
title = {Nonbipartite graphs with the repeated degree property},
journal = {J. Graph Theory},
volume = {26},
number = {1},
pages = {17--25},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199709)26:1\<17::AID-JGT3\>3.0.CO;2-K},
doi = {10.1002/(SICI)1097-0118(199709)26:1\<17::AID-JGT3\>3.0.CO;2-K},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Soltes97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Strickland97,
author = {Debra Mullins Strickland},
title = {Building fences around the chromatic coefficients},
journal = {J. Graph Theory},
volume = {26},
number = {3},
pages = {123--128},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199711)26:3\<123::AID-JGT2\>3.0.CO;2-T},
doi = {10.1002/(SICI)1097-0118(199711)26:3\<123::AID-JGT2\>3.0.CO;2-T},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Strickland97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Urquhart97,
author = {Alasdair Urquhart},
title = {The graph constructions of \emph{H}aj{\'{o}}s and Ore},
journal = {J. Graph Theory},
volume = {26},
number = {4},
pages = {211--215},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199712)26:4\<211::AID-JGT5\>3.0.CO;2-T},
doi = {10.1002/(SICI)1097-0118(199712)26:4\<211::AID-JGT5\>3.0.CO;2-T},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Urquhart97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wan97,
author = {Honghui Wan},
title = {Upper bounds for ramsey numbers R(3, 3, {\(\lessdot\)}, 3) and Schur
numbers},
journal = {J. Graph Theory},
volume = {26},
number = {3},
pages = {119--122},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199711)26:3\<119::AID-JGT1\>3.0.CO;2-U},
doi = {10.1002/(SICI)1097-0118(199711)26:3\<119::AID-JGT1\>3.0.CO;2-U},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wang97,
author = {Hong Wang},
title = {Packing two bipartite graphs into a complete bipartite graph},
journal = {J. Graph Theory},
volume = {26},
number = {2},
pages = {95--104},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199710)26:2\<95::AID-JGT4\>3.0.CO;2-A},
doi = {10.1002/(SICI)1097-0118(199710)26:2\<95::AID-JGT4\>3.0.CO;2-A},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wang97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wang97a,
author = {Hong Wang},
title = {Covering a graph with cycles passing through given edges},
journal = {J. Graph Theory},
volume = {26},
number = {2},
pages = {105--109},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199710)26:2\<105::AID-JGT5\>3.0.CO;2-W},
doi = {10.1002/(SICI)1097-0118(199710)26:2\<105::AID-JGT5\>3.0.CO;2-W},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wang97a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/YanLKC97,
author = {Jing{-}Ho Yan and
Ko{-}Wei Lih and
David Kuo and
Gerard J. Chang},
title = {Signed degree sequences of signed graphs},
journal = {J. Graph Theory},
volume = {26},
number = {2},
pages = {111--117},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199710)26:2\<111::AID-JGT6\>3.0.CO;2-V},
doi = {10.1002/(SICI)1097-0118(199710)26:2\<111::AID-JGT6\>3.0.CO;2-V},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/YanLKC97.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.
retrieved on 2024-09-29 15:21 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:
