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/jgt9.bht:"
download as .bib file
@article{DBLP:journals/jgt/AkiyamaF85,
author = {Jin Akiyama and
Peter Frankl},
title = {On the size of graphs with complete-factors},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {197--201},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090117},
doi = {10.1002/JGT.3190090117},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AkiyamaF85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AkiyamaK85,
author = {Jin Akiyama and
Mikio Kano},
title = {Factors and factorizations of graphs - a survey},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {1--42},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090103},
doi = {10.1002/JGT.3190090103},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AkiyamaK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AkiyamaK85a,
author = {Jin Akiyama and
Mikio Kano},
title = {Almost-regular factorization of graphs},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {123--128},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090110},
doi = {10.1002/JGT.3190090110},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AkiyamaK85a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AlspachH85,
author = {Brian Alspach and
Roland H{\"{a}}ggkvist},
title = {Some observations on the oberwolfach problem},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {177--187},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090114},
doi = {10.1002/JGT.3190090114},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AlspachH85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Ando85,
author = {Kiyoshi Ando},
title = {Rao's conjecture on self-complementary graphs with \emph{K}-factors},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {119--121},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090109},
doi = {10.1002/JGT.3190090109},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Ando85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Andreae85,
author = {Thomas Andreae},
title = {On superperfect noncomparability graphs},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {523--532},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090413},
doi = {10.1002/JGT.3190090413},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Andreae85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Babai85,
author = {L{\'{a}}szl{\'{o}} Babai},
title = {Arc transitive covering digraphs and their eigenvalues},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {363--370},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090308},
doi = {10.1002/JGT.3190090308},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Babai85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BenhocineW85,
author = {Abdelhamid Benhocine and
A. Pawel Wojda},
title = {On self-complementation},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {335--341},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090305},
doi = {10.1002/JGT.3190090305},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BenhocineW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BenzakenHW85,
author = {Claude Benzaken and
Peter L. Hammer and
Dominique de Werra},
title = {Threshold characterization of graphs with dilworth number two},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {245--267},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090207},
doi = {10.1002/JGT.3190090207},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BenzakenHW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BodendiekW85,
author = {Rainer Bodendiek and
Klaus W. Wagner},
title = {On some minimal graphs of the torus},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {411--417},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090312},
doi = {10.1002/JGT.3190090312},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BodendiekW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BollobasSW85,
author = {B{\'{e}}la Bollob{\'{a}}s and
Akira Saito and
Nicholas C. Wormald},
title = {Regular factors of regular graphs},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {97--103},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090107},
doi = {10.1002/JGT.3190090107},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BollobasSW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BondyL85,
author = {J. Adrian Bondy and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Lengths of cycles in halin graphs},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {397--410},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090311},
doi = {10.1002/JGT.3190090311},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BondyL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CameronCRW85,
author = {R. D. Cameron and
Charles J. Colbourn and
Ronald C. Read and
Nicholas C. Wormald},
title = {Cataloguing the graphs on 10 vertices},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {551--562},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090417},
doi = {10.1002/JGT.3190090417},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CameronCRW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChengMW85,
author = {Ching{-}Shui Cheng and
Joseph C. Masaro and
Chi Song Wong},
title = {Do nearly balanced multigraphs have more spanning trees?},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {335--341},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090306},
doi = {10.1002/JGT.3190090306},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChengMW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CockayneGS85,
author = {Ernest J. Cockayne and
B. Gamble and
F. Bruce Shepherd},
title = {An upper bound for the \emph{k}-domination number of a graph},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {533--534},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090414},
doi = {10.1002/JGT.3190090414},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CockayneGS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Delorme85,
author = {Charles Delorme},
title = {Large bipartite graphs with given degree and diameter},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {325--334},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090304},
doi = {10.1002/JGT.3190090304},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Delorme85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Dinitz85,
author = {Jeffrey H. Dinitz},
title = {Orthogonal one-factorization graphs},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {147--159},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090112},
doi = {10.1002/JGT.3190090112},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Dinitz85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DuffusSW85,
author = {Dwight Duffus and
Bill Sands and
Robert E. Woodrow},
title = {On the chromatic number of the product of graphs},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {487--495},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090409},
doi = {10.1002/JGT.3190090409},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DuffusSW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EnomotoJKS85,
author = {Hikoe Enomoto and
Bill Jackson and
P. Katerinis and
Akira Saito},
title = {Toughness and the existence of \emph{k}-factors},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {87--95},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090106},
doi = {10.1002/JGT.3190090106},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EnomotoJKS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Erdos85,
author = {Paul Erd{\"{o}}s},
title = {Ulam, the man and the mathematician},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {445--449},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090402},
doi = {10.1002/JGT.3190090402},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Erdos85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Esfahanian85,
author = {Abdol{-}Hossein Esfahanian},
title = {Lower-bounds on the connectivities of a graph},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {503--511},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090411},
doi = {10.1002/JGT.3190090411},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Esfahanian85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FarberRS85,
author = {Martin Farber and
B. Richter and
H. Shank},
title = {Edge-disjoint spanning trees: {A} connectedness theorem},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {319--324},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090303},
doi = {10.1002/JGT.3190090303},
timestamp = {Mon, 02 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FarberRS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Fink85,
author = {John Frederick Fink},
title = {On smallest regular graphs with a given isopart},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {105--117},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090108},
doi = {10.1002/JGT.3190090108},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Fink85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FishburnG85,
author = {Peter C. Fishburn and
Ronald L. Graham},
title = {Classes of interval graphs under expanding length restrictions},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {459--472},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090405},
doi = {10.1002/JGT.3190090405},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FishburnG85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Frankl85,
author = {Peter Frankl},
title = {On the chromatic number of the general Kneser-graph},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {217--220},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090204},
doi = {10.1002/JGT.3190090204},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Frankl85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FruchtG85,
author = {Roberto W. Frucht and
Reinaldo E. Giudici},
title = {A note on the matching numbers of triangle-free graphs},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {455--458},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090404},
doi = {10.1002/JGT.3190090404},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FruchtG85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hall85,
author = {J. I. Hall},
title = {Graphs with constant link and small degree or order},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {419--444},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090313},
doi = {10.1002/JGT.3190090313},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hall85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HararyP85,
author = {Frank Harary and
Michael Plantholt},
title = {The graph reconstruction number},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {451--454},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090403},
doi = {10.1002/JGT.3190090403},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HararyP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HararyR85,
author = {Frank Harary and
Robert W. Robinson},
title = {Isomorphic factorizations {X:} Unsolved problems},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {67--86},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090105},
doi = {10.1002/JGT.3190090105},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HararyR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HarborthM85,
author = {Heiko Harborth and
Ingrid Mengersen},
title = {An upper bound for the ramsey number r(K\({}_{\mbox{5}}\) - e)},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {483--485},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090408},
doi = {10.1002/JGT.3190090408},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HarborthM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hendry85,
author = {George R. T. Hendry},
title = {On graphs with prescribed median {I}},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {477--481},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090407},
doi = {10.1002/JGT.3190090407},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hendry85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HendryV85,
author = {George Hendry and
Walter Vogler},
title = {The square of a connected S(K\({}_{\mbox{1, 3}}\))-free graph is vertex
pancyclic},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {535--537},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090415},
doi = {10.1002/JGT.3190090415},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HendryV85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hilton85,
author = {Anthony J. W. Hilton},
title = {Factorizations of regular graphs of high degree},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {193--196},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090116},
doi = {10.1002/JGT.3190090116},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hilton85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JungerRP85,
author = {Michael J{\"{u}}nger and
Gerhard Reinelt and
William R. Pulleyblank},
title = {On partitioning the edges of graphs into connected subgraphs},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {539--549},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090416},
doi = {10.1002/JGT.3190090416},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JungerRP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kano85,
author = {Mikio Kano},
title = {[\emph{a}, \emph{b}]-factorization of a graph},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {129--146},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090111},
doi = {10.1002/JGT.3190090111},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kano85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Katerinis85,
author = {P. Katerinis},
title = {Some conditions for the existence of \emph{f}-factors},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {513--521},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090412},
doi = {10.1002/JGT.3190090412},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Katerinis85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kocay85,
author = {William L. Kocay},
title = {On Stockmeyer's non-reconstructible tournaments},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {473--476},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090406},
doi = {10.1002/JGT.3190090406},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kocay85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MatthewsS85,
author = {Manton M. Matthews and
David P. Sumner},
title = {Longest paths and cycles in K\({}_{\mbox{1, 3}}\)-free graphs},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {269--277},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090208},
doi = {10.1002/JGT.3190090208},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MatthewsS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MendelsohnR85,
author = {Eric Mendelsohn and
Alexander Rosa},
title = {One-factorizations of the complete graph - {A} survey},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {43--65},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090104},
doi = {10.1002/JGT.3190090104},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MendelsohnR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Negami85,
author = {Seiya Negami},
title = {Unique and faithful embeddings of projective-planar graphs},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {235--243},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090206},
doi = {10.1002/JGT.3190090206},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Negami85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Owens85,
author = {P. J. Owens},
title = {Shortness parameters for planar graphs with faces of only one type},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {381--395},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090310},
doi = {10.1002/JGT.3190090310},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Owens85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Plantholt85,
author = {Michael Plantholt},
title = {A generalized construction of chromatic index critical graphs from
bipartite graphs},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {371--379},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090309},
doi = {10.1002/JGT.3190090309},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Plantholt85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Pritikin85,
author = {Dan Pritikin},
title = {Bichromaticity of bipartite graphs},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {497--502},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090410},
doi = {10.1002/JGT.3190090410},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Pritikin85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Ramanath85,
author = {M. V. S. Ramanath},
title = {Factors in a class of regular digraphs},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {161--175},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090113},
doi = {10.1002/JGT.3190090113},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Ramanath85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Ruiz85,
author = {Sergio Ruiz},
title = {Isomorphic decomposition of complete graphs into linear forests},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {189--191},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090115},
doi = {10.1002/JGT.3190090115},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Ruiz85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Schmidt-PruzanSU85,
author = {Jeanette Schmidt{-}Pruzan and
Eli Shamir and
Eli Upfal},
title = {Random hypergraph coloring algorithms and the weak chromatic number},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {347--362},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090307},
doi = {10.1002/JGT.3190090307},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Schmidt-PruzanSU85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Schmidt85,
author = {R{\"{u}}diger Schmidt},
title = {Almost reconstructing infinite, rayless graphs},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {205--211},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090202},
doi = {10.1002/JGT.3190090202},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Schmidt85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SlaterTY85,
author = {Peter J. Slater and
S. K. Teo and
H. P. Yap},
title = {Packing a tree with a graph of the same size},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {213--216},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090203},
doi = {10.1002/JGT.3190090203},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SlaterTY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Steif85,
author = {Jeffrey E. Steif},
title = {The frame dimension and the complete overlap dimension of a graph},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {285--299},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090210},
doi = {10.1002/JGT.3190090210},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Steif85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Thomassen85,
author = {Carsten Thomassen},
title = {Gabriel andrew dirac},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {301--318},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090302},
doi = {10.1002/JGT.3190090302},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Thomassen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Usami85,
author = {Yoko Usami},
title = {Extremal graphs of diameter at most 6 after deleting any vertex},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {221--234},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090205},
doi = {10.1002/JGT.3190090205},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Usami85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Whitehead85,
author = {Earl Glen Whitehead Jr.},
title = {Chromaticity of two-trees},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {279--284},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090209},
doi = {10.1002/JGT.3190090209},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Whitehead85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wormald85,
author = {Nicholas C. Wormald},
title = {Enumeration of cyclically 4-connected cubic graphs},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {563--573},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090418},
doi = {10.1002/JGT.3190090418},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wormald85.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-05-20 07:09 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:
