default search action
Search dblp for Publications
export results for "toc:db/journals/jgt/jgt7.bht:"
@article{DBLP:journals/jgt/Abu-SbeihP83, author = {Mohammed Abu{-}Sbeih and Torrence D. Parsons}, title = {Embeddings of bipartite graphs}, journal = {J. Graph Theory}, volume = {7}, number = {3}, pages = {325--334}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070305}, doi = {10.1002/JGT.3190070305}, timestamp = {Fri, 15 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Abu-SbeihP83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Alon83, author = {Noga Alon}, title = {On a conjecture of erd{\"{o}}us, simonovits, and s{\'{o}}s concerning anti-Ramsey theorems}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {91--94}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070112}, doi = {10.1002/JGT.3190070112}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Alon83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BandeltM83, author = {Hans{-}J{\"{u}}rgen Bandelt and Henry Martyn Mulder}, title = {Infinite median graphs, (0, 2)-graphs, and hypercubes}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {487--497}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070415}, doi = {10.1002/JGT.3190070415}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BandeltM83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Batten83, author = {Lynn Margaret Batten}, title = {Geodesic subgraphs}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {159--163}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070203}, doi = {10.1002/JGT.3190070203}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Batten83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Beck83, author = {J{\'{o}}zsef Beck}, title = {On size Ramsey number of paths, trees, and circuits. {I}}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {115--129}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070115}, doi = {10.1002/JGT.3190070115}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Beck83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BenhocineW83, author = {Abdelhamid Benhocine and A. Pawel Wojda}, title = {On the existence of specified cycles in a tournament}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {469--473}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070413}, doi = {10.1002/JGT.3190070413}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BenhocineW83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BollobesFK83, author = {B{\'{e}}la Bollob{\'{a}}s and Ove Frank and Michal Karonski}, title = {On 4-cycles in random bipartite tournaments}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {183--194}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070207}, doi = {10.1002/JGT.3190070207}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BollobesFK83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Brouwer83, author = {Andries E. Brouwer}, title = {The uniqueness of the strongly regular graph on 77 points}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {455--461}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070411}, doi = {10.1002/JGT.3190070411}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Brouwer83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Burr83, author = {S. A. Burr}, title = {Diagonal Ramsey numbers for small graphs}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {57--69}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070108}, doi = {10.1002/JGT.3190070108}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Burr83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BurrE83, author = {Stefan A. Burr and Paul Erd{\"{o}}s}, title = {Generalizations of a Ramsey-theoretic result of chv{\'{a}}tal}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {39--51}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070106}, doi = {10.1002/JGT.3190070106}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BurrE83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BurrFRS83, author = {Stefan A. Burr and Ralph J. Faudree and Cecil C. Rousseau and Richard H. Schelp}, title = {On Ramsey numbers involving starlike multipartite graphs}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {395--409}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070404}, doi = {10.1002/JGT.3190070404}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BurrFRS83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Cai83, author = {Mao{-}Cheng Cai}, title = {Arc-disjoint arborescences of digraphs}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {235--240}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070213}, doi = {10.1002/JGT.3190070213}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Cai83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChartrandKN83, author = {Gary Chartrand and S. F. Kapoor and E. A. Nordhaus}, title = {Hamiltonian path graphs}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {419--427}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070406}, doi = {10.1002/JGT.3190070406}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChartrandKN83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChetwyndW83, author = {Amanda G. Chetwynd and Robin J. Wilson}, title = {The rise and fall of the critical graph conjecture}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {153--157}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070202}, doi = {10.1002/JGT.3190070202}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChetwyndW83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Chung83, author = {F. R. K. Chung}, title = {On a Ramsey-type problem}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {79--83}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070110}, doi = {10.1002/JGT.3190070110}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Chung83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChungG83, author = {F. R. K. Chung and Charles M. Grinstead}, title = {A survey of bounds for classical Ramsey numbers}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {25--37}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070105}, doi = {10.1002/JGT.3190070105}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChungG83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ConwayG83, author = {John H. Conway and Cameron McA. Gordon}, title = {Knots and links in spatial graphs}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {445--453}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070410}, doi = {10.1002/JGT.3190070410}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ConwayG83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/DawesF83, author = {A. M. Dawes and John B. Florence}, title = {Graph dismantling problems}, journal = {J. Graph Theory}, volume = {7}, number = {3}, pages = {335--347}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070306}, doi = {10.1002/JGT.3190070306}, timestamp = {Mon, 25 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/DawesF83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ErdosP83, author = {Paul Erd{\"{o}}s and J{\'{a}}nos Pach}, title = {On a Quasi-Ramsey problem}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {137--147}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070117}, doi = {10.1002/JGT.3190070117}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ErdosP83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ErdosPR83, author = {Paul Erd{\"{o}}s and Edgar M. Palmer and Robert W. Robinson}, title = {Local connectivity of a random graph}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {411--417}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070405}, doi = {10.1002/JGT.3190070405}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ErdosPR83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/FaudreeS83, author = {Ralph J. Faudree and J. Sheehan}, title = {Size Ramsey numbers for small-order graphs}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {53--55}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070107}, doi = {10.1002/JGT.3190070107}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/FaudreeS83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Fink83, author = {John Frederick Fink}, title = {Randomly antitraceable digraphs}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {273}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070216}, doi = {10.1002/JGT.3190070216}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Fink83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Fishburn83, author = {Peter C. Fishburn}, title = {Packing graphs with odd and even trees}, journal = {J. Graph Theory}, volume = {7}, number = {3}, pages = {369--383}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070309}, doi = {10.1002/JGT.3190070309}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Fishburn83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/GouldJ83, author = {Ronald J. Gould and Michael S. Jacobson}, title = {On the Ramsey number of trees versus graphs with large clique number}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {71--78}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070109}, doi = {10.1002/JGT.3190070109}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/GouldJ83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Grace83, author = {Thom Grace}, title = {On sequential labelings of graphs}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {195--201}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070208}, doi = {10.1002/JGT.3190070208}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Grace83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Graham83, author = {Ronald L. Graham}, title = {Euclidean Ramsey theorems on the \emph{n}-sphere}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {105--114}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070114}, doi = {10.1002/JGT.3190070114}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Graham83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Grossman83, author = {Jerrold W. Grossman}, title = {Graphs with unique Ramsey colorings}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {85--90}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070111}, doi = {10.1002/JGT.3190070111}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Grossman83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/GuldanT83, author = {Filip Guldan and Pavel Tomasta}, title = {New lower bounds of some diagonal Ramsey numbers}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {149--151}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070118}, doi = {10.1002/JGT.3190070118}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/GuldanT83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Gyarfas83, author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s}, title = {Vertex coverings by monochromatic paths and cycles}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {131--135}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070116}, doi = {10.1002/JGT.3190070116}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Gyarfas83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HajnalS83, author = {Andr{\'{a}}s Hajnal and Vera T. S{\'{o}}s}, title = {Paul Erd{\"{o}}s is seventy}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {391--393}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070403}, doi = {10.1002/JGT.3190070403}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HajnalS83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Halin83, author = {Rudolf Halin}, title = {On the notion of infinite Hamiltonian graph}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {437--440}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070408}, doi = {10.1002/JGT.3190070408}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Halin83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Harary83, author = {Frank Harary}, title = {A tribute to Frank P. Ramsey, 1903-1930}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {1--7}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070102}, doi = {10.1002/JGT.3190070102}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Harary83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Harary83a, author = {Frank Harary}, title = {In praise of paul erd{\"{o}}s on his seventieth}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {385--390}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070402}, doi = {10.1002/JGT.3190070402}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Harary83a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HararyK83, author = {Frank Harary and Peter Kov{\'{a}}cs}, title = {Regular graphs with given girth pair}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {209--218}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070210}, doi = {10.1002/JGT.3190070210}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HararyK83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Heinrich83, author = {Katherine Heinrich}, title = {Partitioning oriented 2-paths}, journal = {J. Graph Theory}, volume = {7}, number = {3}, pages = {359--367}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070308}, doi = {10.1002/JGT.3190070308}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Heinrich83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Holroyd83, author = {Fred C. Holroyd}, title = {Enumeration of acyclic and unicyclic nets with four types of self-duality}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {241--260}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070214}, doi = {10.1002/JGT.3190070214}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Holroyd83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Kirschenhofer83, author = {Peter Kirschenhofer}, title = {On the average shape of simply generated families of trees}, journal = {J. Graph Theory}, volume = {7}, number = {3}, pages = {311--323}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070304}, doi = {10.1002/JGT.3190070304}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Kirschenhofer83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Matula83, author = {David W. Matula}, title = {Ramsey theory for graph connectivity}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {95--103}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070113}, doi = {10.1002/JGT.3190070113}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Matula83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/McKee83, author = {Terry A. McKee}, title = {Series-parallel graphs: {A} logical approach}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {177--181}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070206}, doi = {10.1002/JGT.3190070206}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/McKee83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Mellor83, author = {D. H. Mellor}, title = {The eponymous F. P. Ramsey}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {9--13}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070103}, doi = {10.1002/JGT.3190070103}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Mellor83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/PennW83, author = {Laurence E. Penn and David Witte}, title = {When the cartesian product of two directed cycles is hypo-Hamiltonian}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {441--443}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070409}, doi = {10.1002/JGT.3190070409}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/PennW83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/PoljakRP83, author = {Svatopluk Poljak and Vojtech R{\"{o}}dl and Ales Pultr}, title = {On a product dimension of bipartite graphs}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {475--486}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070414}, doi = {10.1002/JGT.3190070414}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/PoljakRP83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Proulx83, author = {Viera Krnanov{\'{a}} Proulx}, title = {On the genus of five- and six-regular graphs}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {231--234}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070212}, doi = {10.1002/JGT.3190070212}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Proulx83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Quinn83, author = {S. J. Quinn}, title = {Isomorphic factorizations of complete equipartite graphs}, journal = {J. Graph Theory}, volume = {7}, number = {3}, pages = {285--310}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070303}, doi = {10.1002/JGT.3190070303}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Quinn83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/RobinsonW83, author = {Robert W. Robinson and Nicholas C. Wormald}, title = {Numbers of cubic graphs}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {463--467}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070412}, doi = {10.1002/JGT.3190070412}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/RobinsonW83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Schuster83, author = {Seymour Schuster}, title = {Interpolation theorem for the number of end-vertices of spanning trees}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {203--208}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070209}, doi = {10.1002/JGT.3190070209}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Schuster83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Spencer83, author = {Joel Spencer}, title = {Ramsey theory and Ramsey theoreticians}, journal = {J. Graph Theory}, volume = {7}, number = {1}, pages = {15--23}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070104}, doi = {10.1002/JGT.3190070104}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Spencer83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Thomassen83, author = {Carsten Thomassen}, title = {Graph decomposition with constraints on the connectivity and minimum degree}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {165--167}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070204}, doi = {10.1002/JGT.3190070204}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Thomassen83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Thomassen83a, author = {Carsten Thomassen}, title = {A theorem on paths in planar graphs}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {169--176}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070205}, doi = {10.1002/JGT.3190070205}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Thomassen83a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Thomassen83b, author = {Carsten Thomassen}, title = {Graph decomposition with applications to subdivisions and path systems modulo \emph{k}}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {261--271}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070215}, doi = {10.1002/JGT.3190070215}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Thomassen83b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Tomescu83, author = {Ioan Tomescu}, title = {On Hamiltonian-connected regular graphs}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {429--436}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070407}, doi = {10.1002/JGT.3190070407}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Tomescu83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Wright83, author = {Edward M. Wright}, title = {The number of connected sparsely edged graphs. {IV} large nonseparable graphs}, journal = {J. Graph Theory}, volume = {7}, number = {2}, pages = {219--229}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070211}, doi = {10.1002/JGT.3190070211}, timestamp = {Wed, 20 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Wright83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Younger83, author = {D. H. Younger}, title = {Integer flows}, journal = {J. Graph Theory}, volume = {7}, number = {3}, pages = {349--357}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070307}, doi = {10.1002/JGT.3190070307}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Younger83.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.