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/jgt15.bht:"
download as .bib file
@article{DBLP:journals/jgt/AlspachCH91,
author = {Brian Alspach and
C. C. Chen and
Katherine Heinrich},
title = {Characterization of a class of triangle-free graphs with a certain
adjacency property},
journal = {J. Graph Theory},
volume = {15},
number = {4},
pages = {375--388},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150404},
doi = {10.1002/JGT.3190150404},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AlspachCH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Avery91,
author = {Peter Avery},
title = {Score sequences of oriented graphs},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {251--257},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150303},
doi = {10.1002/JGT.3190150303},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Avery91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Babai91,
author = {L{\'{a}}szl{\'{o}} Babai},
title = {Vertex-transitive graphs and vertex-transitive maps},
journal = {J. Graph Theory},
volume = {15},
number = {6},
pages = {587--627},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150605},
doi = {10.1002/JGT.3190150605},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Babai91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BauH91,
author = {Sheng Bau and
Derek A. Holton},
title = {Cycles containing 12 vertices in 3-connected cubic graphs},
journal = {J. Graph Theory},
volume = {15},
number = {4},
pages = {421--429},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150407},
doi = {10.1002/JGT.3190150407},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BauH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BergeF91,
author = {Claude Berge and
Jean{-}Claude Fournier},
title = {A short proof for a generalization of Vizing's theorem},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {333--336},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150309},
doi = {10.1002/JGT.3190150309},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BergeF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaV91,
author = {Haitze J. Broersma and
Henk Jan Veldman},
title = {Long dominating cycles and paths in graphs with large neighborhood
unions},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {29--38},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150106},
doi = {10.1002/JGT.3190150106},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Cai91,
author = {Mao{-}Cheng Cai},
title = {[\emph{a, b}]-factorizations of graphs},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {283--301},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150306},
doi = {10.1002/JGT.3190150306},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Cai91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Caro91,
author = {Yair Caro},
title = {On zero-sum delta-systems and multiple copies of hypergraphs},
journal = {J. Graph Theory},
volume = {15},
number = {5},
pages = {511--521},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150505},
doi = {10.1002/JGT.3190150505},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Caro91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaroKR91,
author = {Yair Caro and
Ilia Krasikov and
Yehuda Roditty},
title = {On the largest tree of given maximum degree in a connected graph},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {7--13},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150103},
doi = {10.1002/JGT.3190150103},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CaroKR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaroT91,
author = {Yair Caro and
Zsolt Tuza},
title = {Improved lower bounds on \emph{k}-independence},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {99--107},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150110},
doi = {10.1002/JGT.3190150110},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CaroT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChangTL91,
author = {Maw{-}Shang Chang and
Chuan Yi Tang and
Richard C. T. Lee},
title = {20-relative neighborhood graphs are hamiltonian},
journal = {J. Graph Theory},
volume = {15},
number = {5},
pages = {543--557},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150507},
doi = {10.1002/JGT.3190150507},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChangTL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChaudharyG91,
author = {Sharad Chaudhary and
Gary Gordon},
title = {Tutte polynomials for trees},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {317--331},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150308},
doi = {10.1002/JGT.3190150308},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChaudharyG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChoudumP91,
author = {Sheshayya A. Choudum and
M. S. Paulraj},
title = {Regular factors in \emph{K}\({}_{\mbox{1, 3}}\)-free graphs},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {259--265},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150304},
doi = {10.1002/JGT.3190150304},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChoudumP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChungG91,
author = {Fan R. K. Chung and
Ronald L. Graham},
title = {Quasi-random tournaments},
journal = {J. Graph Theory},
volume = {15},
number = {2},
pages = {173--198},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150206},
doi = {10.1002/JGT.3190150206},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChungG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DengP91,
author = {Xiaotie Deng and
Christos H. Papadimitriou},
title = {On path lengths modulo three},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {267--282},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150305},
doi = {10.1002/JGT.3190150305},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DengP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Ding91,
author = {Guoli Ding},
title = {Covering the edges with consecutive sets},
journal = {J. Graph Theory},
volume = {15},
number = {5},
pages = {559--562},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150508},
doi = {10.1002/JGT.3190150508},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Ding91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EgawaO91,
author = {Yoshimi Egawa and
Katsuhiro Ota},
title = {Regular factors in \emph{K}\({}_{\mbox{1, \emph{n}}}\) free graphs},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {337--344},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150310},
doi = {10.1002/JGT.3190150310},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EgawaO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Ellingham91,
author = {Mark N. Ellingham},
title = {Vertex-switching, isomorphism, and pseudosimilarity},
journal = {J. Graph Theory},
volume = {15},
number = {6},
pages = {563--572},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150602},
doi = {10.1002/JGT.3190150602},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Ellingham91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ErdosGK91,
author = {Paul Erd{\"{o}}s and
John G. Gimbel and
Dieter Kratsch},
title = {Some extremal results in cochromatic and dichromatic theory},
journal = {J. Graph Theory},
volume = {15},
number = {6},
pages = {579--585},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150604},
doi = {10.1002/JGT.3190150604},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ErdosGK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FavaronMS91,
author = {Odile Favaron and
Maryvonne Mah{\'{e}}o and
Jean{-}Fran{\c{c}}ois Sacl{\'{e}}},
title = {On the residue of a graph},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {39--64},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150107},
doi = {10.1002/JGT.3190150107},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FavaronMS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Gould91,
author = {Ronald J. Gould},
title = {Updating the hamiltonian problem - {A} survey},
journal = {J. Graph Theory},
volume = {15},
number = {2},
pages = {121--157},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150204},
doi = {10.1002/JGT.3190150204},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Gould91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GrossR91,
author = {Jonathan L. Gross and
Robert G. Rieper},
title = {Local extrema in genus-stratified graphs},
journal = {J. Graph Theory},
volume = {15},
number = {2},
pages = {159--171},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150205},
doi = {10.1002/JGT.3190150205},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GrossR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HartvigsenM91,
author = {David Hartvigsen and
Russell Mardon},
title = {The prism-free planar graphs and their cycles bases},
journal = {J. Graph Theory},
volume = {15},
number = {4},
pages = {431--441},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150408},
doi = {10.1002/JGT.3190150408},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HartvigsenM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Huang91,
author = {Qingxue Huang},
title = {On the decomposition of \emph{K}\({}_{\mbox{\emph{n}}}\) into complete
\emph{m}-partite graphs},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {1--6},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150102},
doi = {10.1002/JGT.3190150102},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Huang91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jackson91,
author = {Bill Jackson},
title = {Neighborhood unions and hamilton cycles},
journal = {J. Graph Theory},
volume = {15},
number = {4},
pages = {443--451},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150409},
doi = {10.1002/JGT.3190150409},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Jackson91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JacobsonMS91,
author = {Michael S. Jacobson and
Fred R. McMorris and
Edward R. Scheinerman},
title = {General results on tolerance intersection graphs},
journal = {J. Graph Theory},
volume = {15},
number = {6},
pages = {573--577},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150603},
doi = {10.1002/JGT.3190150603},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JacobsonMS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KanekoS91,
author = {Atsushi Kaneko and
Akira Saito},
title = {Cycles intersecting a prescribed vertex set},
journal = {J. Graph Theory},
volume = {15},
number = {6},
pages = {655--664},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150609},
doi = {10.1002/JGT.3190150609},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KanekoS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KezdyM91,
author = {Andr{\'{e}} E. K{\'{e}}zdy and
Patrick McGuinness},
title = {Do 3\emph{n} - 5 edges force a subdivision of \emph{K}\({}_{\mbox{5}}\)?},
journal = {J. Graph Theory},
volume = {15},
number = {4},
pages = {389--406},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150405},
doi = {10.1002/JGT.3190150405},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KezdyM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kitakubo91,
author = {Shigeru Kitakubo},
title = {Bounding the number of embeddings of 5-connected projective-planar
graphs},
journal = {J. Graph Theory},
volume = {15},
number = {2},
pages = {199--205},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150207},
doi = {10.1002/JGT.3190150207},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kitakubo91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lu91,
author = {Zhikang Lu},
title = {On an upper bound for the harmonious chromatic number of a graph},
journal = {J. Graph Theory},
volume = {15},
number = {4},
pages = {345--347},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150402},
doi = {10.1002/JGT.3190150402},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Lu91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Luczak91,
author = {Tomasz Luczak},
title = {How to deal with unlabeled random graphs},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {303--316},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150307},
doi = {10.1002/JGT.3190150307},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Luczak91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Madej91,
author = {Tom Madej},
title = {Bounds for the crossing number of the \emph{N}-cube},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {81--97},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150109},
doi = {10.1002/JGT.3190150109},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Madej91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MahadevP91,
author = {Nadimpalli V. R. Mahadev and
Uri N. Peled},
title = {On a conjecture of wang and williams},
journal = {J. Graph Theory},
volume = {15},
number = {2},
pages = {115--120},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150203},
doi = {10.1002/JGT.3190150203},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MahadevP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/McDiarmid91,
author = {Colin McDiarmid},
title = {Expected numbers at hitting times},
journal = {J. Graph Theory},
volume = {15},
number = {6},
pages = {637--648},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150607},
doi = {10.1002/JGT.3190150607},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/McDiarmid91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/McDiarmidX91,
author = {Colin McDiarmid and
Luo Xinhua},
title = {Upper bounds for harmonious colorings},
journal = {J. Graph Theory},
volume = {15},
number = {6},
pages = {629--636},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150606},
doi = {10.1002/JGT.3190150606},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/McDiarmidX91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Olariu91,
author = {Stephan Olariu},
title = {On the homogeneous representation of interval graphs},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {65--80},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150108},
doi = {10.1002/JGT.3190150108},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Olariu91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Olariu91a,
author = {Stephan Olariu},
title = {On the structure of unbreakable graphs},
journal = {J. Graph Theory},
volume = {15},
number = {4},
pages = {349--373},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150403},
doi = {10.1002/JGT.3190150403},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Olariu91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Raspaud91,
author = {Andr{\'{e}} Raspaud},
title = {Cycle covers of graphs with a nowhere-zero 4-flow},
journal = {J. Graph Theory},
volume = {15},
number = {6},
pages = {649--654},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150608},
doi = {10.1002/JGT.3190150608},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Raspaud91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/RobertsonT91,
author = {Neil Robertson and
Robin Thomas},
title = {On the orientable genus of graphs embedded in the klein bottle},
journal = {J. Graph Theory},
volume = {15},
number = {4},
pages = {407--419},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150406},
doi = {10.1002/JGT.3190150406},
timestamp = {Fri, 27 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/RobertsonT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Sidorenko91,
author = {A. F. Sidorenko},
title = {An upper bound on the ramsey number \emph{R}(\emph{K}\({}_{\mbox{3}}\),
\emph{G}) depending only on the size of the graph \emph{G}},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {15--17},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150104},
doi = {10.1002/JGT.3190150104},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Sidorenko91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SierksmaH91,
author = {Gerard Sierksma and
Han Hoogeveen},
title = {Seven criteria for integer sequences being graphic},
journal = {J. Graph Theory},
volume = {15},
number = {2},
pages = {223--231},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150209},
doi = {10.1002/JGT.3190150209},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SierksmaH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/WangW91,
author = {Chi Wang and
A. C. Williams},
title = {The threshold weight of a graph},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {235--249},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150302},
doi = {10.1002/JGT.3190150302},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/WangW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Yu91,
author = {Xingxing Yu},
title = {On the cycle-isomorphism of graphs},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {19--27},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150105},
doi = {10.1002/JGT.3190150105},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Yu91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Yu91a,
author = {Min{-}Li Yu},
title = {Almost resolvable \emph{P}\({}_{\mbox{\emph{k}}}\)-decompositions
of complete graphs},
journal = {J. Graph Theory},
volume = {15},
number = {5},
pages = {523--541},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150506},
doi = {10.1002/JGT.3190150506},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Yu91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Zhang91,
author = {Guo{-}Hui Zhang},
title = {Smallest regular graphs with prescribed odd girth},
journal = {J. Graph Theory},
volume = {15},
number = {5},
pages = {453--467},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150502},
doi = {10.1002/JGT.3190150502},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Zhang91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Zhou91,
author = {Huishan Zhou},
title = {Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs},
journal = {J. Graph Theory},
volume = {15},
number = {5},
pages = {469--488},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150503},
doi = {10.1002/JGT.3190150503},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Zhou91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Zhou91a,
author = {Huishan Zhou},
title = {Multiplicativity. Part {II.} Nonmultiplicative digraphs and characterization
of oriented paths},
journal = {J. Graph Theory},
volume = {15},
number = {5},
pages = {489--509},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150504},
doi = {10.1002/JGT.3190150504},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Zhou91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Zito91,
author = {Jennifer S. Zito},
title = {The structure and maximum number of maximum independent sets in trees},
journal = {J. Graph Theory},
volume = {15},
number = {2},
pages = {207--221},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150208},
doi = {10.1002/JGT.3190150208},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Zito91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ZverovichZ91,
author = {Igor E. Zverovich and
Vadim E. Zverovich},
title = {A characterization of domination perfect graphs},
journal = {J. Graph Theory},
volume = {15},
number = {2},
pages = {109--114},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150202},
doi = {10.1002/JGT.3190150202},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ZverovichZ91.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-26 22:00 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:
