Search dblp for Publications

export results for "toc:db/journals/jct/jctb29.bht:"

 download as .bib file

@article{DBLP:journals/jct/AbbottLT80,
  author       = {H. L. Abbott and
                  A. Liu and
                  Bjarne Toft},
  title        = {The enumeration problem for color critical linear hypergraphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {106--115},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90047-7},
  doi          = {10.1016/0095-8956(80)90047-7},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/AbbottLT80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/AlbertsonB80,
  author       = {Michael O. Albertson and
                  David M. Berman},
  title        = {The chromatic difference sequence of a graph},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {1--12},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90040-4},
  doi          = {10.1016/0095-8956(80)90040-4},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/AlbertsonB80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Benzaken80,
  author       = {Claude Benzaken},
  title        = {Critical hypergraphs for the weak chromatic number},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {3},
  pages        = {328--338},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90090-8},
  doi          = {10.1016/0095-8956(80)90090-8},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Benzaken80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/BlassHM80,
  author       = {Andreas Blass and
                  Frank Harary and
                  Zevi Miller},
  title        = {Which trees are link graphs?},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {3},
  pages        = {277--292},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90085-4},
  doi          = {10.1016/0095-8956(80)90085-4},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/BlassHM80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Boyle80,
  author       = {R. D. Boyle},
  title        = {Reconstructing some bipartite graphs from their spanning trees},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {2},
  pages        = {272--275},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90084-2},
  doi          = {10.1016/0095-8956(80)90084-2},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Boyle80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/BridgesT80,
  author       = {William G. Bridges and
                  Sam Toueg},
  title        = {On the impossibility of Directed Moore Graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {3},
  pages        = {339--341},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90091-X},
  doi          = {10.1016/0095-8956(80)90091-X},
  timestamp    = {Sat, 01 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/BridgesT80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/CriscuoloKMT80,
  author       = {Giovanni Criscuolo and
                  Chung{-}Mo Kwok and
                  Abbe Mowshowitz and
                  Roberto Tortora},
  title        = {The group and the minimal polynomial of a graph},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {3},
  pages        = {293--302},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90086-6},
  doi          = {10.1016/0095-8956(80)90086-6},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/CriscuoloKMT80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/DjokovicM80,
  author       = {Dragomir Z. Djokovic and
                  Gary L. Miller},
  title        = {Regular groups of automorphisms of cubic graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {2},
  pages        = {195--230},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90081-7},
  doi          = {10.1016/0095-8956(80)90081-7},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/DjokovicM80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Donaghey80a,
  author       = {Robert Donaghey},
  title        = {Automorphisms on Catalan trees and bracketings},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {75--90},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90045-3},
  doi          = {10.1016/0095-8956(80)90045-3},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Donaghey80a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/EntringerS80,
  author       = {Roger C. Entringer and
                  Henda C. Swart},
  title        = {Spanning cycles of nearly cubic graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {3},
  pages        = {303--309},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90087-8},
  doi          = {10.1016/0095-8956(80)90087-8},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/EntringerS80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Fleischner80,
  author       = {Herbert Fleischner},
  title        = {Eulersche linien und Kreis{\"{u}}berdeckungen, die vorgegebene
                  durchg{\"{a}}nge in den Kanten vermeiden},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {2},
  pages        = {145--167},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90077-5},
  doi          = {10.1016/0095-8956(80)90077-5},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Fleischner80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/FoldesS80,
  author       = {Stephane Foldes and
                  Richard Steinberg},
  title        = {A topological space for which graph embeddability is undecidable},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {3},
  pages        = {342--344},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90092-1},
  doi          = {10.1016/0095-8956(80)90092-1},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/FoldesS80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Fournier80,
  author       = {J.{-}C. Fournier},
  title        = {Isomorphismes d'hypergraphes par intersections {\'{e}}quicardinales
                  d'ar{\^{e}}tes et configurations exclues},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {3},
  pages        = {321--327},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90089-1},
  doi          = {10.1016/0095-8956(80)90089-1},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Fournier80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Frank80,
  author       = {Andr{\'{a}}s Frank},
  title        = {On chain and antichain families of a partially ordered set},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {2},
  pages        = {176--184},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90079-9},
  doi          = {10.1016/0095-8956(80)90079-9},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Frank80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Gobel80,
  author       = {F. G{\"{o}}bel},
  title        = {On a 1-1-correspondence between rooted trees and natural numbers},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {141--143},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90049-0},
  doi          = {10.1016/0095-8956(80)90049-0},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Gobel80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Godsil80,
  author       = {Chris D. Godsil},
  title        = {Neighbourhoods of transitive graphs and GRR's},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {116--140},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90048-9},
  doi          = {10.1016/0095-8956(80)90048-9},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Godsil80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Jackson80,
  author       = {Bill Jackson},
  title        = {Hamilton cycles in regular 2-connected graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {27--46},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90042-8},
  doi          = {10.1016/0095-8956(80)90042-8},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Jackson80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Little80,
  author       = {Charles H. C. Little},
  title        = {A characterization of planar cubic graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {2},
  pages        = {185--194},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90080-5},
  doi          = {10.1016/0095-8956(80)90080-5},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Little80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/LovaszNP80,
  author       = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
                  Jaroslav Nesetril and
                  Ales Pultr},
  title        = {On a product dimension of graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {47--67},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90043-X},
  doi          = {10.1016/0095-8956(80)90043-X},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/LovaszNP80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/NewbornM80,
  author       = {Monroe M. Newborn and
                  William O. J. Moser},
  title        = {Optimal crossing-free Hamiltonian circuit drawings of K\({}_{\mbox{n}}\)},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {13--26},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90041-6},
  doi          = {10.1016/0095-8956(80)90041-6},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/NewbornM80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/OKeefeW80,
  author       = {M. O'Keefe and
                  P. K. Wong},
  title        = {A smallest graph of girth 10 and valency 3},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {91--105},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90046-5},
  doi          = {10.1016/0095-8956(80)90046-5},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/OKeefeW80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Parsons80,
  author       = {Torrence D. Parsons},
  title        = {Circulant graph imbeddings},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {3},
  pages        = {310--320},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90088-X},
  doi          = {10.1016/0095-8956(80)90088-X},
  timestamp    = {Fri, 15 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Parsons80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Thomassen80,
  author       = {Carsten Thomassen},
  title        = {Planarity and duality of finite and infinite graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {2},
  pages        = {244--271},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90083-0},
  doi          = {10.1016/0095-8956(80)90083-0},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Thomassen80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Tillson80,
  author       = {Timothy W. Tillson},
  title        = {A Hamiltonian decomposition of K\({}_{\mbox{2m}}\)\({}^{\mbox{*}}\),
                  2m {\textgreater}= 8},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {1},
  pages        = {68--74},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90044-1},
  doi          = {10.1016/0095-8956(80)90044-1},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Tillson80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Vergnas80,
  author       = {Michel Las Vergnas},
  title        = {Convexity in oriented matroids},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {2},
  pages        = {231--243},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90082-9},
  doi          = {10.1016/0095-8956(80)90082-9},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Vergnas80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Wagon80,
  author       = {Stanley Wagon},
  title        = {A bound on the chromatic number of graphs without certain induced
                  subgraphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {3},
  pages        = {345--346},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90093-3},
  doi          = {10.1016/0095-8956(80)90093-3},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Wagon80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/White80a,
  author       = {Neil L. White},
  title        = {The transcendence degree of a coordinatization of a combinatorial
                  geometry},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {29},
  number       = {2},
  pages        = {168--175},
  year         = {1980},
  url          = {https://doi.org/10.1016/0095-8956(80)90078-7},
  doi          = {10.1016/0095-8956(80)90078-7},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/White80a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.