Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jct/AgeevK00,
  author       = {Alexander A. Ageev and
                  Alexandr V. Kostochka},
  title        = {Vertex Set Partitions Preserving Conservativeness},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {202--217},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1972},
  doi          = {10.1006/JCTB.2000.1972},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/AgeevK00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/BollobasPR00,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Luke Pebody and
                  Oliver Riordan},
  title        = {Contraction-Deletion Invariants for Graphs},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {320--345},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1988},
  doi          = {10.1006/JCTB.2000.1988},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/BollobasPR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Chen00a,
  author       = {Ya{-}Chen Chen},
  title        = {Kneser Graphs Are Hamiltonian For \emph{n}ge\emph{3k}},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {69--79},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1969},
  doi          = {10.1006/JCTB.2000.1969},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Chen00a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/CherlinL00,
  author       = {Gregory L. Cherlin and
                  Brenda J. Latka},
  title        = {Minimal Antichains in Well-founded Quasi-orders with an Application
                  to Tournaments},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {258--276},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1986},
  doi          = {10.1006/JCTB.2000.1986},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/CherlinL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Eaton00,
  author       = {Nancy Eaton},
  title        = {A Near Packing of Two Graphs},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {98--103},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1971},
  doi          = {10.1006/JCTB.2000.1971},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Eaton00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/GebhardS00,
  author       = {David D. Gebhard and
                  Bruce E. Sagan},
  title        = {Sinks in Acyclic Orientations of Graphs},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {130--146},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1975},
  doi          = {10.1006/JCTB.2000.1975},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/GebhardS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/GeelenOVW00,
  author       = {James F. Geelen and
                  James G. Oxley and
                  Dirk Vertigan and
                  Geoffrey P. Whittle},
  title        = {On the Excluded Minors for Quaternary Matroids},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {57--68},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1967},
  doi          = {10.1006/JCTB.2000.1967},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/GeelenOVW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Havet00,
  author       = {Fr{\'{e}}d{\'{e}}ric Havet},
  title        = {Oriented Hamiltonian Cycles in Tournaments},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {1--31},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1959},
  doi          = {10.1006/JCTB.2000.1959},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Havet00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/HuangL00,
  author       = {Yuanqiu Huang and
                  Yanpei Liu},
  title        = {Face Size and the Maximum Genus of a Graph 1. Simple Graphs},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {356--370},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1990},
  doi          = {10.1006/JCTB.2000.1990},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/HuangL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/KanekoO00,
  author       = {Atsushi Kaneko and
                  Katsuhiro Ota},
  title        = {On Minimally (n, )-Connected Graphs},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {156--171},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1979},
  doi          = {10.1006/JCTB.2000.1979},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/KanekoO00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/KimP00a,
  author       = {Jeong Han Kim and
                  Boris G. Pittel},
  title        = {On Tail Distribution of Interpost Distance},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {49--56},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1966},
  doi          = {10.1006/JCTB.2000.1966},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/KimP00a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Kriesell00,
  author       = {Matthias Kriesell},
  title        = {Contractible Subgraphs in 3-Connected Graphs},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {32--48},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1960},
  doi          = {10.1006/JCTB.2000.1960},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Kriesell00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Lando00,
  author       = {Sergei K. Lando},
  title        = {On a Hopf Algebra in Graph Theory},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {104--121},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1973},
  doi          = {10.1006/JCTB.2000.1973},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Lando00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Maharry00,
  author       = {John Maharry},
  title        = {A Characterization of Graphs with No Cube Minor},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {179--201},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1968},
  doi          = {10.1006/JCTB.2000.1968},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Maharry00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/MizunoS00,
  author       = {Hirobumi Mizuno and
                  Iwao Sato},
  title        = {Zeta Functions of Graph Coverings},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {247--257},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1983},
  doi          = {10.1006/JCTB.2000.1983},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/MizunoS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/NesetrilR00,
  author       = {Jaroslav Nesetril and
                  Andr{\'{e}} Raspaud},
  title        = {Colored Homomorphisms of Colored Mixed Graphs},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {147--155},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1977},
  doi          = {10.1006/JCTB.2000.1977},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/NesetrilR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/NesetrilT00,
  author       = {Jaroslav Nesetril and
                  Claude Tardif},
  title        = {Duality Theorems for Finite Structures (Characterising Gaps and Good
                  Characterisations)},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {80--97},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1970},
  doi          = {10.1006/JCTB.2000.1970},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/NesetrilT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/PachT00,
  author       = {J{\'{a}}nos Pach and
                  G{\'{e}}za T{\'{o}}th},
  title        = {Which Crossing Number Is It Anyway?},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {225--246},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1978},
  doi          = {10.1006/JCTB.2000.1978},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/PachT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Richer00,
  author       = {Duncan C. Richer},
  title        = {Unordered Canonical Ramsey Numbers},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {172--177},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1980},
  doi          = {10.1006/JCTB.2000.1980},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Richer00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/RobertshawW00,
  author       = {Andrew M. Robertshaw and
                  Douglas R. Woodall},
  title        = {Triangles and Neighbourhoods of Independent Sets in Graphs},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {1},
  pages        = {122--129},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1974},
  doi          = {10.1006/JCTB.2000.1974},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/RobertshawW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Schrijver00,
  author       = {Alexander Schrijver},
  title        = {A Combinatorial Algorithm Minimizing Submodular Functions in Strongly
                  Polynomial Time},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {346--355},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1989},
  doi          = {10.1006/JCTB.2000.1989},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Schrijver00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/SkinnerST00,
  author       = {J. D. Skinner II and
                  C. A. B. Smith and
                  W. T. Tutte},
  title        = {On the Dissection of Rectangles into Right-Angled Isosceles Triangles},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {277--319},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1987},
  doi          = {10.1006/JCTB.2000.1987},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/SkinnerST00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Thomassen00,
  author       = {Carsten Thomassen},
  title        = {Chromatic Roots and Hamiltonian Paths},
  journal      = {J. Comb. Theory {B}},
  volume       = {80},
  number       = {2},
  pages        = {218--224},
  year         = {2000},
  url          = {https://doi.org/10.1006/jctb.2000.1976},
  doi          = {10.1006/JCTB.2000.1976},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/Thomassen00.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.