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/jgt12.bht:"
download as .bib file
@article{DBLP:journals/jgt/AignerT88,
author = {Martin Aigner and
Eberhard Triesch},
title = {Searching for an edge in a graph},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {45--57},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120106},
doi = {10.1002/JGT.3190120106},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AignerT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AldredBHR88,
author = {Robert E. L. Aldred and
Sheng Bau and
Derek A. Holton and
Gordon F. Royle},
title = {An 11-vertex theorem for 3-connected cubic graphs},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {561--570},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120412},
doi = {10.1002/JGT.3190120412},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AldredBHR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ArchdeaconR88,
author = {Dan Archdeacon and
R. Bruce Richter},
title = {On the parity of crossing numbers},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {307--310},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120302},
doi = {10.1002/JGT.3190120302},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ArchdeaconR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BandeltM88,
author = {Hans{-}J{\"{u}}rgen Bandelt and
Henry Martyn Mulder},
title = {Regular pseudo-median graphs},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {533--549},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120410},
doi = {10.1002/JGT.3190120410},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BandeltM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BienstockG88,
author = {Daniel Bienstock and
Ervin Gy{\"{o}}ri},
title = {Average distance in graphs with removed elements},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {375--390},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120309},
doi = {10.1002/JGT.3190120309},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BienstockG88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bouchet88,
author = {Andr{\'{e}} Bouchet},
title = {Transforming trees by successive local complementations},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {195--207},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120210},
doi = {10.1002/JGT.3190120210},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Bouchet88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Broersma88,
author = {Haitze J. Broersma},
title = {Existence of {\(\Delta\)}\({}_{\mbox{{\(\lambda\)}}}\)-cycles and
{\(\Delta\)}\({}_{\mbox{{\(\lambda\)}}}\)-paths},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {499--507},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120405},
doi = {10.1002/JGT.3190120405},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Broersma88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BuckleyL88,
author = {Fred Buckley and
Martin Lewinter},
title = {A note on graphs with diameter-preserving spanning trees},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {525--528},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120408},
doi = {10.1002/JGT.3190120408},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BuckleyL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaccettaEV88,
author = {Lou Caccetta and
Paul Erd{\"{o}}s and
K. Vijayan},
title = {Graphs with unavoidable subgraphs with large degrees},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {17--27},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120104},
doi = {10.1002/JGT.3190120104},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CaccettaEV88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Catlin88,
author = {Paul A. Catlin},
title = {A reduction method to find spanning Eulerian subgraphs},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {29--44},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120105},
doi = {10.1002/JGT.3190120105},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Catlin88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Chung88,
author = {F. R. K. Chung},
title = {The average distance and the independence number},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {229--235},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120213},
doi = {10.1002/JGT.3190120213},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Chung88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChungCG88,
author = {Fan R. K. Chung and
Joel E. Cohen and
Ronald L. Graham},
title = {Pursuit - Evasion games on graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {159--167},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120205},
doi = {10.1002/JGT.3190120205},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChungCG88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EllinghamPY88,
author = {Mark N. Ellingham and
L{\'{a}}szl{\'{o}} Pyber and
Xingxing Yu},
title = {Claw-free graphs are edge reconstructible},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {445--451},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120317},
doi = {10.1002/JGT.3190120317},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EllinghamPY88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EnomotoOK88,
author = {Hikoe Enomoto and
Katsuhiro Ota and
Mikio Kano},
title = {A sufficient condition for a bipartite graph to have a \emph{k}-factor},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {141--151},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120115},
doi = {10.1002/JGT.3190120115},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EnomotoOK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Erdos88,
author = {Paul Erd{\"{o}}s},
title = {A tribute to Torrence Parsons},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {v--vi},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120203},
doi = {10.1002/JGT.3190120203},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Erdos88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ErdosGPS88,
author = {Paul Erd{\"{o}}s and
Mark Goldberg and
J{\'{a}}nos Pach and
Joel Spencer},
title = {Cutting a graph into two dissimilar halves},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {121--131},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120113},
doi = {10.1002/JGT.3190120113},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ErdosGPS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Fajtlowicz88,
author = {Siemion Fajtlowicz},
title = {A characterization of radius-critical graphs},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {529--532},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120409},
doi = {10.1002/JGT.3190120409},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Fajtlowicz88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Fan88,
author = {Genghua Fan},
title = {Degree sum for a triangle in a graph},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {249--263},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120216},
doi = {10.1002/JGT.3190120216},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Fan88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FranklP88,
author = {Peter Frankl and
J{\'{a}}nos Pach},
title = {An extremal problem on \emph{K\({}_{\mbox{r}}\)}-free graphs},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {519--523},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120407},
doi = {10.1002/JGT.3190120407},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FranklP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Gerards88,
author = {A. M. H. Gerards},
title = {Homomorphisms of graphs into odd cycles},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {73--83},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120108},
doi = {10.1002/JGT.3190120108},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Gerards88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Guangfu88,
author = {Zhao Guangfu},
title = {Characterizations of second iterated line graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {285--294},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120218},
doi = {10.1002/JGT.3190120218},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Guangfu88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GyarfasL88,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {On-line and first fit colorings of graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {217--227},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120212},
doi = {10.1002/JGT.3190120212},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GyarfasL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HakimiS88,
author = {S. Louis Hakimi and
Edward F. Schmeichel},
title = {Chromatic factorizations of a graph},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {177--182},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120207},
doi = {10.1002/JGT.3190120207},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HakimiS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Harary88,
author = {Frank Harary},
title = {In memory of Torrence Parsons, 1941-1987},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {iii--ii},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120202},
doi = {10.1002/JGT.3190120202},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Harary88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HeinrichL88,
author = {Katherine Heinrich and
Guizhen Liu},
title = {A lower bound on the number of spanning trees with \emph{k} end-vertices},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {95--100},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120110},
doi = {10.1002/JGT.3190120110},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HeinrichL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hendry88,
author = {George R. T. Hendry},
title = {On minimum degree in Hamiltonian path graphs},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {491--497},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120404},
doi = {10.1002/JGT.3190120404},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hendry88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HoangK88,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
N. Khouzam},
title = {On brittle graphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {391--404},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120310},
doi = {10.1002/JGT.3190120310},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HoangK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hofmeister88,
author = {M. Hofmeister},
title = {Counting double covers of graphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {437--444},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120316},
doi = {10.1002/JGT.3190120316},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hofmeister88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jackson88,
author = {Bill Jackson},
title = {Some remarks on Arc-connectivity, vertex splitting, and orientation
in graphs and digraphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {429--436},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120314},
doi = {10.1002/JGT.3190120314},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Jackson88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jungreis88,
author = {Douglas S. Jungreis},
title = {Generalized hamiltonian circuits in the cartesian product of two-directed
cycles},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {113--120},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120112},
doi = {10.1002/JGT.3190120112},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Jungreis88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KratochvilZ88,
author = {Jan Kratochv{\'{\i}}l and
Dainis Zeps},
title = {On the number of Hamiltonian cycles in triangulations},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {191--194},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120209},
doi = {10.1002/JGT.3190120209},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KratochvilZ88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lai88,
author = {Hong{-}Jian Lai},
title = {Contractions and hamiltonian line graphs},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {11--15},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120103},
doi = {10.1002/JGT.3190120103},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Lai88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Liu88,
author = {Guizhen Liu},
title = {On connectivities of tree graphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {453--459},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120318},
doi = {10.1002/JGT.3190120318},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Liu88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lonc88,
author = {Zbigniew Lonc},
title = {On resolvable tree-decompositions of complete graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {295--303},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120219},
doi = {10.1002/JGT.3190120219},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/Lonc88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Luczak88,
author = {Tomasz Luczak},
title = {On \emph{k}-leaf connectivity of a random graph},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {1--10},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120102},
doi = {10.1002/JGT.3190120102},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/Luczak88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MeirM88,
author = {Amram Meir and
John W. Moon},
title = {On maximal independent sets of nodes in trees},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {265--283},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120217},
doi = {10.1002/JGT.3190120217},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MeirM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MollerCB88,
author = {Martina M{\"{o}}ller and
Hans Georg Carstens and
Gunnar Brinkmann},
title = {Nowhere-zero flows in low genus graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {183--190},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120208},
doi = {10.1002/JGT.3190120208},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MollerCB88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MonmaRT88,
author = {Clyde L. Monma and
Bruce A. Reed and
William T. Trotter},
title = {Threshold tolerance graphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {343--362},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120307},
doi = {10.1002/JGT.3190120307},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MonmaRT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MuderWW88,
author = {Douglas J. Muder and
Margaret Lefevre Weaver and
Douglas B. West},
title = {Pagenumber of complete bipartite graphs},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {469--489},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120403},
doi = {10.1002/JGT.3190120403},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MuderWW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Olariu88,
author = {Stephan Olariu},
title = {On the strong perfect graph conjecture},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {169--176},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120206},
doi = {10.1002/JGT.3190120206},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Olariu88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Paoli88,
author = {Madeleine Paoli},
title = {Hamiltonian properties of the cube of a 2-edge connected graph},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {85--94},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120109},
doi = {10.1002/JGT.3190120109},
timestamp = {Thu, 19 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Paoli88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ParsonsP88,
author = {Torrence D. Parsons and
Tomaz Pisanski},
title = {Exotic \emph{n}-universal graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {155--158},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120204},
doi = {10.1002/JGT.3190120204},
timestamp = {Fri, 15 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ParsonsP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Petrovic88,
author = {Vojislav Petrovic},
title = {Some unavoidable subdigraphs of tournaments},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {317--325},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120304},
doi = {10.1002/JGT.3190120304},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Petrovic88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/RadziszowskiK88,
author = {Stanislaw P. Radziszowski and
Donald L. Kreher},
title = {Search algorithm for Ramsey graphs by union of group orbits},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {59--72},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120107},
doi = {10.1002/JGT.3190120107},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/RadziszowskiK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Richter88,
author = {R. Bruce Richter},
title = {Cubic graphs with crossing number two},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {363--374},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120308},
doi = {10.1002/JGT.3190120308},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Richter88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SachsSW88,
author = {Horst Sachs and
Michael Stiebitz and
Robin J. Wilson},
title = {An historical note: Euler's K{\"{o}}nigsberg letters},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {133--139},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120114},
doi = {10.1002/JGT.3190120114},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SachsSW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Scheinerman88,
author = {Edward R. Scheinerman},
title = {On the interval number of a chordal graph},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {311--316},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120303},
doi = {10.1002/JGT.3190120303},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Scheinerman88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Shibata88,
author = {Yukio Shibata},
title = {On the tree representation of chordal graphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {421--428},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120313},
doi = {10.1002/JGT.3190120313},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Shibata88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Speckenmeyer88,
author = {Ewald Speckenmeyer},
title = {On feedback vertex sets and nonseparating independent sets in cubic
graphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {405--412},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120311},
doi = {10.1002/JGT.3190120311},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Speckenmeyer88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Thomason88,
author = {Andrew Thomason},
title = {An upper bound for some ramsey numbers},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {509--517},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120406},
doi = {10.1002/JGT.3190120406},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Thomason88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Thomassen88,
author = {Carsten Thomassen},
title = {On the presence of disjoint subgraphs of a specified type},
journal = {J. Graph Theory},
volume = {12},
number = {1},
pages = {101--111},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120111},
doi = {10.1002/JGT.3190120111},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Thomassen88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Thomassen88a,
author = {Carsten Thomassen},
title = {Rectilinear drawings of graphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {335--341},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120306},
doi = {10.1002/JGT.3190120306},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Thomassen88a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Traczyk88,
author = {Tomasz Traczyk Jr.},
title = {A dirac-type theorem for squares of graphs},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {463--467},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120402},
doi = {10.1002/JGT.3190120402},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Traczyk88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Vaderlind88,
author = {Paul Vaderlind},
title = {Chromaticity of triangulated graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {245--248},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120215},
doi = {10.1002/JGT.3190120215},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Vaderlind88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Veldman88,
author = {Henk Jan Veldman},
title = {A result on Hamiltonian line graphs involving restrictions on induced
subgraphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {413--420},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120312},
doi = {10.1002/JGT.3190120312},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Veldman88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Vince88,
author = {Andrew Vince},
title = {Star chromatic number},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {551--559},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120411},
doi = {10.1002/JGT.3190120411},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Vince88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wei88,
author = {Victor K. Wei},
title = {A connection between a convex programming problem and the {LYM} property
on perfect graphs},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {571--587},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120413},
doi = {10.1002/JGT.3190120413},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wei88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Yang88,
author = {Yongzhi Yang},
title = {The reconstruction conjecture is true if all 2-connected graphs are
reconstructible},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {237--243},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120214},
doi = {10.1002/JGT.3190120214},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Yang88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/YutingK88,
author = {Cui Yuting and
Mikio Kano},
title = {Some results on odd factors of graphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {327--333},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120305},
doi = {10.1002/JGT.3190120305},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/YutingK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Zhang88,
author = {Cun{-}Quan Zhang},
title = {Hamilton cycles in claw-free graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {209--216},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120211},
doi = {10.1002/JGT.3190120211},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Zhang88.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-28 04:54 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:
