Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jgt/jgt16.bht:"
@article{DBLP:journals/jgt/Ainouche92, author = {Ahmed Ainouche}, title = {An improvement of fraisse's sufficient condition for hamiltonian graphs}, journal = {J. Graph Theory}, volume = {16}, number = {6}, pages = {529--543}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160602}, doi = {10.1002/JGT.3190160602}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Ainouche92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ArochaBN92, author = {Jorge L. Arocha and Javier Bracho and Victor Neumann{-}Lara}, title = {On the minimum size of tight hypergraphs}, journal = {J. Graph Theory}, volume = {16}, number = {4}, pages = {319--326}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160405}, doi = {10.1002/JGT.3190160405}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ArochaBN92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Bandelt92, author = {Hans{-}J{\"{u}}rgen Bandelt}, title = {Centroids and medians of finite metric spaces}, journal = {J. Graph Theory}, volume = {16}, number = {4}, pages = {305--317}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160404}, doi = {10.1002/JGT.3190160404}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Bandelt92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BienstockD92, author = {Daniel Bienstock and Nathaniel Dean}, title = {New results on rectilinear crossing numbers and plane embeddings}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {389--398}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160502}, doi = {10.1002/JGT.3190160502}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BienstockD92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Brand92, author = {Neal Brand}, title = {Almost all steinhaus graphs have diameter 2}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {213--219}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160304}, doi = {10.1002/JGT.3190160304}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Brand92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BroersmaL92, author = {Haitze J. Broersma and Xueliang Li}, title = {The connectivity of the basis graph of a branching greedoid}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {233--237}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160306}, doi = {10.1002/JGT.3190160306}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BroersmaL92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Caro92, author = {Yair Caro}, title = {On several variations of the turan and ramsey numbers}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {257--266}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160309}, doi = {10.1002/JGT.3190160309}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Caro92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Catlin92, author = {Paul A. Catlin}, title = {Supereulerian graphs: {A} survey}, journal = {J. Graph Theory}, volume = {16}, number = {2}, pages = {177--196}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160209}, doi = {10.1002/JGT.3190160209}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Catlin92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChenS92, author = {Guantao Chen and Richard H. Schelp}, title = {Hamiltonian graphs involving distances}, journal = {J. Graph Theory}, volume = {16}, number = {2}, pages = {121--129}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160203}, doi = {10.1002/JGT.3190160203}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChenS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChetwyndH92, author = {Amanda G. Chetwynd and Anthony J. W. Hilton}, title = {Alternating hamiltonian cycles in two colored complete bipartite graphs}, journal = {J. Graph Theory}, volume = {16}, number = {2}, pages = {153--158}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160206}, doi = {10.1002/JGT.3190160206}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChetwyndH92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChewY92, author = {K. H. Chew and H. P. Yap}, title = {Total chromatic number of complete \emph{r}-partite graphs}, journal = {J. Graph Theory}, volume = {16}, number = {6}, pages = {629--634}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160608}, doi = {10.1002/JGT.3190160608}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChewY92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Chung92, author = {Fan R. K. Chung}, title = {Subgraphs of a hypercube containing no small even cycles}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {273--286}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160311}, doi = {10.1002/JGT.3190160311}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Chung92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChungS92, author = {Fan R. K. Chung and Shlomo Sternberg}, title = {Laplacian and vibrational spectra for homogeneous graphs}, journal = {J. Graph Theory}, volume = {16}, number = {6}, pages = {605--627}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160607}, doi = {10.1002/JGT.3190160607}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgt/ChungS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Clark92, author = {Lane H. Clark}, title = {The minimum number of subgraphs in a graph and its complement}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {451--458}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160506}, doi = {10.1002/JGT.3190160506}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Clark92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ColbournHR92, author = {Charles J. Colbourn and Dean G. Hoffman and C. A. Rodger}, title = {Directed star decompositions of the complete directed graph}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {517--528}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160511}, doi = {10.1002/JGT.3190160511}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ColbournHR92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Ding92, author = {Guoli Ding}, title = {Subgraphs and well-quasi-ordering}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {489--502}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160509}, doi = {10.1002/JGT.3190160509}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Ding92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/DinitzGG92, author = {Jeffrey H. Dinitz and David K. Garnick and Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s}, title = {On the irregularity strength of the \emph{m} {\texttimes} \emph{n} grid}, journal = {J. Graph Theory}, volume = {16}, number = {4}, pages = {355--374}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160409}, doi = {10.1002/JGT.3190160409}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/DinitzGG92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Donner92, author = {Quentin Donner}, title = {On the number of list-colorings}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {239--245}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160307}, doi = {10.1002/JGT.3190160307}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Donner92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Faudree92, author = {Ralph J. Faudree}, title = {Complete subgraphs with large degree sums}, journal = {J. Graph Theory}, volume = {16}, number = {4}, pages = {327--334}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160406}, doi = {10.1002/JGT.3190160406}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Faudree92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/FaudreeS92, author = {Ralph J. Faudree and Mikl{\'{o}}s Simonovits}, title = {Ramsey problems and their connection to tu{\'{r}}an-type extremal problems}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {25--50}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160105}, doi = {10.1002/JGT.3190160105}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/FaudreeS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Feder92, author = {Tom{\'{a}}s Feder}, title = {Product graph representations}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {467--488}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160508}, doi = {10.1002/JGT.3190160508}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Feder92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Fiol92, author = {Miguel Angel Fiol}, title = {On super-edge-connected digraphs and bipartite digraphs}, journal = {J. Graph Theory}, volume = {16}, number = {6}, pages = {545--555}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160603}, doi = {10.1002/JGT.3190160603}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Fiol92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/FishburnG92, author = {Peter C. Fishburn and William V. Gehrlein}, title = {Niche numbers}, journal = {J. Graph Theory}, volume = {16}, number = {2}, pages = {131--139}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160204}, doi = {10.1002/JGT.3190160204}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/FishburnG92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Frick92, author = {Marietjie Frick}, title = {On replete graphs}, journal = {J. Graph Theory}, volume = {16}, number = {2}, pages = {165--175}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160208}, doi = {10.1002/JGT.3190160208}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Frick92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Furedi92, author = {Zolt{\'{a}}n F{\"{u}}redi}, title = {The maximum number of edges in a minimal graph of diameter 2}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {81--98}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160110}, doi = {10.1002/JGT.3190160110}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Furedi92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/FurediK92, author = {Zolt{\'{a}}n F{\"{u}}redi and Daniel J. Kleitman}, title = {On zero-trees}, journal = {J. Graph Theory}, volume = {16}, number = {2}, pages = {107--120}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160202}, doi = {10.1002/JGT.3190160202}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/FurediK92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/GoddardHS92, author = {Wayne Goddard and Michael A. Henning and Henda C. Swart}, title = {Some nordhaus- gaddum-type results}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {221--231}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160305}, doi = {10.1002/JGT.3190160305}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/GoddardHS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HaggkvistC92, author = {Roland H{\"{a}}ggkvist and Amanda G. Chetwynd}, title = {Some upper bounds on the total and list chromatic numbers of multigraphs}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {503--516}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160510}, doi = {10.1002/JGT.3190160510}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HaggkvistC92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HavilandT92, author = {Julie Haviland and Andrew Thomason}, title = {Rotation numers for complete bipartite graphs}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {61--71}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160107}, doi = {10.1002/JGT.3190160107}, timestamp = {Wed, 03 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HavilandT92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Hind92, author = {H. R. Hind}, title = {An upper bound for the total chromatic number of dense graphs}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {197--203}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160302}, doi = {10.1002/JGT.3190160302}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Hind92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Hoede92, author = {Cornelis Hoede}, title = {A characterization of consistent marked graphs}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {17--23}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160104}, doi = {10.1002/JGT.3190160104}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Hoede92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HoffmanR92, author = {Dean G. Hoffman and Christopher A. Rodger}, title = {The chromatic index of complete multipartite graphs}, journal = {J. Graph Theory}, volume = {16}, number = {2}, pages = {159--163}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160207}, doi = {10.1002/JGT.3190160207}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HoffmanR92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Huck92, author = {Andreas Huck}, title = {Edge-disjoint paths and cycles in \emph{n}-edge-connected graphs}, journal = {J. Graph Theory}, volume = {16}, number = {6}, pages = {571--589}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160605}, doi = {10.1002/JGT.3190160605}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Huck92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Manoussakis92, author = {Yannis Manoussakis}, title = {Directed hamiltonian graphs}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {51--59}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160106}, doi = {10.1002/JGT.3190160106}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Manoussakis92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Mao92, author = {Jingzhong Mao}, title = {The structure of geodetic blocks with diameter two}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {247--255}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160308}, doi = {10.1002/JGT.3190160308}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Mao92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MarusicS92, author = {Dragan Marusic and Raffaele Scapellato}, title = {Characterizing vertex-transitive \emph{pq}-graphs with an imprimitive automorphism subgroup}, journal = {J. Graph Theory}, volume = {16}, number = {4}, pages = {375--387}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160410}, doi = {10.1002/JGT.3190160410}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MarusicS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/McKayM92, author = {Brendan D. McKay and Zhang Ke Min}, title = {The value of the Ramsey number \emph{r}(3, 8)}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {99--105}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160111}, doi = {10.1002/JGT.3190160111}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/McKayM92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Negami92, author = {Seiya Negami}, title = {Projective-planar graphs with even duals}, journal = {J. Graph Theory}, volume = {16}, number = {4}, pages = {287--295}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160402}, doi = {10.1002/JGT.3190160402}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Negami92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Nishimura92, author = {Tsuyoshi Nishimura}, title = {A degree condition for the existence of \emph{k}-factors}, journal = {J. Graph Theory}, volume = {16}, number = {2}, pages = {141--151}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160205}, doi = {10.1002/JGT.3190160205}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Nishimura92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/OlaruM92, author = {Elefterie Olaru and Eugen Mandrescu}, title = {\emph{s}-strongly perfect cartesian product of graphs}, journal = {J. Graph Theory}, volume = {16}, number = {4}, pages = {297--303}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160403}, doi = {10.1002/JGT.3190160403}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/OlaruM92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/SauerZ92, author = {Norbert W. Sauer and X. Zhu}, title = {An approach to hedetniemi's conjecture}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {423--436}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160504}, doi = {10.1002/JGT.3190160504}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/SauerZ92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Shi92, author = {Ronghua Shi}, title = {2-neighborhoods and hamiltonian conditions}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {267--271}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160310}, doi = {10.1002/JGT.3190160310}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Shi92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Sidorenko92, author = {A. F. Sidorenko}, title = {On ramsey-tu{\'{r}}an numbers for 3-graphs}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {73--78}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160108}, doi = {10.1002/JGT.3190160108}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Sidorenko92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/SiranT92, author = {Jozef Sir{\'{a}}n and Zsolt Tuza}, title = {Nearly uniform distribution of edges among \emph{k}-subgraphs of a graph}, journal = {J. Graph Theory}, volume = {16}, number = {6}, pages = {591--604}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160606}, doi = {10.1002/JGT.3190160606}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/SiranT92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Soares92, author = {Jos{\`{e}} Soares}, title = {Maximum diameter of regular digraphs}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {437--450}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160505}, doi = {10.1002/JGT.3190160505}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Soares92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/SwaminathanW92, author = {R. Swaminathan and Donald K. Wagner}, title = {Vertex 2-isomorphism}, journal = {J. Graph Theory}, volume = {16}, number = {4}, pages = {335--347}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160407}, doi = {10.1002/JGT.3190160407}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/SwaminathanW92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/TeoK92, author = {Chung{-}Piaw Teo and Khee Meng Koh}, title = {The number of shortest cycles and the chromatic uniqueness of a graph}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {7--15}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160103}, doi = {10.1002/JGT.3190160103}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/TeoK92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/WakelinW92, author = {C. D. Wakelin and Douglas R. Woodall}, title = {Chromatic polynomials, polygon trees, and outerplanar graphs}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {459--466}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160507}, doi = {10.1002/JGT.3190160507}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/WakelinW92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Woodall92, author = {Douglas R. Woodall}, title = {A short proof of a theorem of dirac's about hadwiger's conjecture}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {79--80}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160109}, doi = {10.1002/JGT.3190160109}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Woodall92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Yu92, author = {Qinglin Yu}, title = {A note on \emph{n}-extendable graphs}, journal = {J. Graph Theory}, volume = {16}, number = {4}, pages = {349--353}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160408}, doi = {10.1002/JGT.3190160408}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Yu92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Zaslavsky92, author = {Thomas Zaslavsky}, title = {Orientation embedding of signed graphs}, journal = {J. Graph Theory}, volume = {16}, number = {5}, pages = {399--422}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160503}, doi = {10.1002/JGT.3190160503}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Zaslavsky92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Zhang92, author = {Hong Zhang}, title = {Self-complementary symmetric graphs}, journal = {J. Graph Theory}, volume = {16}, number = {1}, pages = {1--5}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160102}, doi = {10.1002/JGT.3190160102}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Zhang92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Zhang92a, author = {Guo{-}Hui Zhang}, title = {The maximum valency of regular graphs with given order and odd girth}, journal = {J. Graph Theory}, volume = {16}, number = {3}, pages = {205--211}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160303}, doi = {10.1002/JGT.3190160303}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Zhang92a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Zhu92, author = {Xuding Zhu}, title = {Star chromatic numbers and products of graphs}, journal = {J. Graph Theory}, volume = {16}, number = {6}, pages = {557--569}, year = {1992}, url = {https://doi.org/10.1002/jgt.3190160604}, doi = {10.1002/JGT.3190160604}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Zhu92.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.