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/jgt3.bht:"
download as .bib file
@article{DBLP:journals/jgt/Anderson79,
author = {Ian Anderson},
title = {Infinite families of biembedding numbers},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {263--268},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030309},
doi = {10.1002/JGT.3190030309},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Anderson79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Avis79,
author = {David Avis},
title = {On minimal 5-chromatic triangle-free graphs},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {397--400},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030411},
doi = {10.1002/JGT.3190030411},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Avis79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Babai79,
author = {L{\'{a}}szl{\'{o}} Babai},
title = {Long cycles in vertex-transitive graphs},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {301--304},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030314},
doi = {10.1002/JGT.3190030314},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Babai79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BauerT79,
author = {Douglas Bauer and
Ralph Tindell},
title = {Graphs with prescribed connectivity and line graph connectivity},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {393--395},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030410},
doi = {10.1002/JGT.3190030410},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BauerT79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Berman79,
author = {Kenneth A. Berman},
title = {Spanning arborescences, ingraphs, and outgraphs},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {141--150},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030206},
doi = {10.1002/JGT.3190030206},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Berman79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BermanS79,
author = {Kenneth A. Berman and
H. Shank},
title = {Full 4-colorings of 4-regular maps},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {291--294},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030312},
doi = {10.1002/JGT.3190030312},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BermanS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BlassH79,
author = {Andreas Blass and
Frank Harary},
title = {Properties of almost all graphs and complexes},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {225--240},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030305},
doi = {10.1002/JGT.3190030305},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BlassH79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BollobasC79,
author = {B{\'{e}}la Bollob{\'{a}}s and
Ernest J. Cockayne},
title = {Graph-theoretic parameters concerning domination, independence, and
irredundance},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {241--249},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030306},
doi = {10.1002/JGT.3190030306},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BollobasC79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChatyC79,
author = {Guy Chaty and
Michel Chein},
title = {Minimally 2-edge connected graphs},
journal = {J. Graph Theory},
volume = {3},
number = {1},
pages = {15--22},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030103},
doi = {10.1002/JGT.3190030103},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChatyC79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChvatalFST79,
author = {Vasek Chv{\'{a}}tal and
Herbert Fleischner and
J. Sheehan and
Carsten Thomassen},
title = {Three-regular subgraphs of four-regular graphs},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {371--386},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030408},
doi = {10.1002/JGT.3190030408},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChvatalFST79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Clapham79,
author = {C. R. J. Clapham},
title = {A class of self-complementary graphs and lower bounds of some ramsey
numbers},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {287--289},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030311},
doi = {10.1002/JGT.3190030311},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Clapham79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ColbournR79,
author = {Charles J. Colbourn and
Ronald C. Read},
title = {Orderly algorithms for generating restricted classes of graphs},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {187--195},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030210},
doi = {10.1002/JGT.3190030210},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/ColbournR79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CvetkovicS79,
author = {Dragos M. Cvetkovic and
Slobodan K. Simic},
title = {A bibliography of graph equations},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {311--324},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030402},
doi = {10.1002/JGT.3190030402},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CvetkovicS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EdelmanS79,
author = {Paul H. Edelman and
Michael E. Saks},
title = {Group labelings of graphs},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {135--140},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030205},
doi = {10.1002/JGT.3190030205},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EdelmanS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Garman79,
author = {Brian L. Garman},
title = {Voltage graph embeddings and the associated block designs},
journal = {J. Graph Theory},
volume = {3},
number = {1},
pages = {53--67},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030107},
doi = {10.1002/JGT.3190030107},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Garman79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Gati79,
author = {Georg Gati},
title = {Further annotated bibliography on the isomorphism disease},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {95--109},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030202},
doi = {10.1002/JGT.3190030202},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Gati79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Gessel79,
author = {Ira M. Gessel},
title = {Tournaments and Vandermond's determinant},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {305--307},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030315},
doi = {10.1002/JGT.3190030315},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Gessel79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GoldsmithE79,
author = {Donald L. Goldsmith and
Roger C. Entringer},
title = {A sufficient condition for equality of edge-connectivity and minimum
degree of a graph},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {251--255},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030307},
doi = {10.1002/JGT.3190030307},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GoldsmithE79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Grotschel79,
author = {Martin Gr{\"{o}}tschel},
title = {On minimal strong blocks},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {213--219},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030303},
doi = {10.1002/JGT.3190030303},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Grotschel79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GrotschelH79,
author = {Martin Gr{\"{o}}tschel and
Frank Harary},
title = {The graphs for which all strong orientations are hamiltonian},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {221--223},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030304},
doi = {10.1002/JGT.3190030304},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GrotschelH79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HakimiS79,
author = {Seifollah Louis Hakimi and
Edward F. Schmeichel},
title = {On the number of cycles of length \emph{k} in a maximal planar graph},
journal = {J. Graph Theory},
volume = {3},
number = {1},
pages = {69--86},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030108},
doi = {10.1002/JGT.3190030108},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HakimiS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HakimiST79,
author = {Seifollah Louis Hakimi and
Edward F. Schmeichel and
Carsten Thomassen},
title = {On the number of hamiltonian cycles in a maximal planar graph},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {365--370},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030407},
doi = {10.1002/JGT.3190030407},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HakimiST79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hanlon79,
author = {Phil Hanlon},
title = {Enumeration of graphs by degree sequence},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {295--299},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030313},
doi = {10.1002/JGT.3190030313},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hanlon79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HellQ79,
author = {Pavol Hell and
Louis V. Quintas},
title = {An intermediate value theorem for graphs with given automorphism group},
journal = {J. Graph Theory},
volume = {3},
number = {1},
pages = {35--41},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030105},
doi = {10.1002/JGT.3190030105},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HellQ79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jaeger79,
author = {Fran{\c{c}}ois Jaeger},
title = {A Note on Sub-Eulerian Graphs},
journal = {J. Graph Theory},
volume = {3},
number = {1},
pages = {91--93},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030110},
doi = {10.1002/JGT.3190030110},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Jaeger79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JaegerPX79,
author = {Fran{\c{c}}ois Jaeger and
Charles Payan and
Nguyen Huy Xuong},
title = {A class of upper-embeddable graphs},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {387--391},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030409},
doi = {10.1002/JGT.3190030409},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JaegerPX79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kevorkian79,
author = {Aram Kevorkian},
title = {Graph-theoretic characterization of the matrix property of full irreducibility
without using a transversal},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {151--174},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030207},
doi = {10.1002/JGT.3190030207},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kevorkian79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kevorkian79a,
author = {Aram Kevorkian},
title = {Erratum: Graph-theoretic characterization of the matrix property of
full irreducibility without using a transversal},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {411},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030414},
doi = {10.1002/JGT.3190030414},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kevorkian79a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kotzig79,
author = {Anton Kotzig},
title = {1-Factorizations of cartesian products of regular graphs},
journal = {J. Graph Theory},
volume = {3},
number = {1},
pages = {23--34},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030104},
doi = {10.1002/JGT.3190030104},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kotzig79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KroparR79,
author = {Marg Kropar and
Ronald C. Read},
title = {On the construction of the self-complementary graphs on 12 nodes},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {111--125},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030203},
doi = {10.1002/JGT.3190030203},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KroparR79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KulliAB79,
author = {V. R. Kulli and
D. G. Akka and
Lowell W. Beineke},
title = {On Line Graphs with Crossing Number 1},
journal = {J. Graph Theory},
volume = {3},
number = {1},
pages = {87--90},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030109},
doi = {10.1002/JGT.3190030109},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KulliAB79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lauri79,
author = {Josef Lauri},
title = {Edge-reconstruction of planar graphs with minimum valency 5},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {269--286},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030310},
doi = {10.1002/JGT.3190030310},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Lauri79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LindnerMMW79,
author = {Charles C. Lindner and
Eric Mendelsohn and
Nathan Saul Mendelsohn and
Barry Wolk},
title = {Orthogonal latin square graphs},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {325--338},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030403},
doi = {10.1002/JGT.3190030403},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LindnerMMW79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Manca79,
author = {Paolo Manca},
title = {Generating all planer graphs regular of degree four},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {357--364},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030406},
doi = {10.1002/JGT.3190030406},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Manca79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/NowakowskiR79,
author = {Richard J. Nowakowski and
Ivan Rival},
title = {Fixed-edge theorem for graphs with loops},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {339--350},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030404},
doi = {10.1002/JGT.3190030404},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/NowakowskiR79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/OberlySS79,
author = {David J. Oberly and
Slobodan K. Simic and
David P. Sumner},
title = {Every connected, locally connected nontrivial graph with no induced
claw is hamiltonian},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {351--356},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030405},
doi = {10.1002/JGT.3190030405},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/OberlySS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Pulleyblank79,
author = {William R. Pulleyblank},
title = {A note on graphs spanned by Eulerian graphs},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {309--310},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030316},
doi = {10.1002/JGT.3190030316},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Pulleyblank79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/RawlinsonE79,
author = {Kim T. Rawlinson and
Roger C. Entringer},
title = {Class of graphs with restricted neighborhoods},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {257--262},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030308},
doi = {10.1002/JGT.3190030308},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/RawlinsonE79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Ringeisen79,
author = {Richard D. Ringeisen},
title = {Survey of results on the maximum genus of a graph},
journal = {J. Graph Theory},
volume = {3},
number = {1},
pages = {1--13},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030102},
doi = {10.1002/JGT.3190030102},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Ringeisen79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Riordan79,
author = {John Riordan},
title = {Forests of label-increasing trees},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {127--133},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030204},
doi = {10.1002/JGT.3190030204},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Riordan79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ShoesmithS79,
author = {D. J. Shoesmith and
T. J. Smiley},
title = {Theorem on directed graphs, applicable to logic},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {401--406},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030412},
doi = {10.1002/JGT.3190030412},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ShoesmithS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Staples79,
author = {Jo Ann W. Staples},
title = {On some subclasses of well-covered graphs},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {197--204},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030211},
doi = {10.1002/JGT.3190030211},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Staples79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Straight79,
author = {H. Joseph Straight},
title = {Cochromatic Number and the Genus of a Graph},
journal = {J. Graph Theory},
volume = {3},
number = {1},
pages = {43--51},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030106},
doi = {10.1002/JGT.3190030106},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Straight79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Summer79,
author = {David P. Summer},
title = {Randomly matchable graphs},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {183--186},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030209},
doi = {10.1002/JGT.3190030209},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Summer79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/TrotterH79,
author = {William T. Trotter and
Frank Harary},
title = {On double and multiple interval graphs},
journal = {J. Graph Theory},
volume = {3},
number = {3},
pages = {205--211},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030302},
doi = {10.1002/JGT.3190030302},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/TrotterH79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Werra79,
author = {Dominique de Werra},
title = {On the use of alternating chains and hypergraphs in edge coloring},
journal = {J. Graph Theory},
volume = {3},
number = {2},
pages = {175--182},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030208},
doi = {10.1002/JGT.3190030208},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Werra79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wong79,
author = {Pak{-}Ken Wong},
title = {On the uniqueness of the smallest graph of girth 5 and valency 6},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {407--409},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030413},
doi = {10.1002/JGT.3190030413},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wong79.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-23 19:49 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:
