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/jct/jctb78.bht:"
download as .bib file
@article{DBLP:journals/jct/BenjaminiHM00,
author = {Itai Benjamini and
Olle H{\"{a}}ggstr{\"{o}}m and
Elchanan Mossel},
title = {On Random Graph Homomorphisms into {Z}},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {86--114},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1931},
doi = {10.1006/JCTB.1999.1931},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BenjaminiHM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BonningtonGGS00,
author = {C. Paul Bonnington and
Mike J. Grannell and
Terry S. Griggs and
Jozef Sir{\'{a}}n},
title = {Exponential Families of Non-Isomorphic Triangulations of Complete
Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {2},
pages = {169--184},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1939},
doi = {10.1006/JCTB.1999.1939},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BonningtonGGS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BrightwellW00,
author = {Graham R. Brightwell and
Peter Winkler},
title = {Gibbs Measures and Dismantlable Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {141--166},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1935},
doi = {10.1006/JCTB.1999.1935},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BrightwellW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CaenF00,
author = {Dominique de Caen and
Zolt{\'{a}}n F{\"{u}}redi},
title = {The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {2},
pages = {274--276},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1938},
doi = {10.1006/JCTB.1999.1938},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/CaenF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Dong00,
author = {Feng Ming Dong},
title = {Proof of a Chromatic Polynomial Conjecture},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {35--44},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1925},
doi = {10.1006/JCTB.1999.1925},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Dong00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/EllinghamZ00,
author = {Mark N. Ellingham and
Xiaoya Zha},
title = {The Spectral Radius of Graphs on Surfaces},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {45--56},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1926},
doi = {10.1006/JCTB.1999.1926},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/EllinghamZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FanZ00,
author = {Genghua Fan and
Cun{-}Quan Zhang},
title = {Circuit Decompositions of Eulerian Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {1--23},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1923},
doi = {10.1006/JCTB.1999.1923},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FanZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GutinY00,
author = {Gregory Z. Gutin and
Anders Yeo},
title = {Quasi-Hamiltonicity: {A} Series of Necessary Conditions for a Digraph
to Be Hamiltonian},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {2},
pages = {232--242},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1942},
doi = {10.1006/JCTB.1999.1942},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GutinY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HavetT00,
author = {Fr{\'{e}}d{\'{e}}ric Havet and
St{\'{e}}phan Thomass{\'{e}}},
title = {Oriented Hamiltonian Paths in Tournaments: {A} Proof of Rosenfeld's
Conjecture},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {2},
pages = {243--273},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1945},
doi = {10.1006/JCTB.1999.1945},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HavetT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HuangM00,
author = {Qiongxiang Huang and
Jixiang Meng},
title = {A Classification of \emph{DCI(CI)}-Subsets for Cyclic Group of Odd
Prime Power Order},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {24--34},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1924},
doi = {10.1006/JCTB.1999.1924},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HuangM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/IlaniL00,
author = {Hagai Ilani and
Michael Lomonosov},
title = {Maximum Balanced Flow in a Network},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {2},
pages = {185--197},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1940},
doi = {10.1006/JCTB.1999.1940},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/IlaniL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kierstead00,
author = {Hal A. Kierstead},
title = {A Simple Competitive Graph Coloring Algorithm},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {57--68},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1927},
doi = {10.1006/JCTB.1999.1927},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kierstead00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kochol00,
author = {Martin Kochol},
title = {Equivalence of Fleischner's and Thomassen's Conjectures},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {2},
pages = {277--279},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1944},
doi = {10.1006/JCTB.1999.1944},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kochol00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kriesell00a,
author = {Matthias Kriesell},
title = {The \emph{k}-Critical 2\emph{k}-Connected Graphs for \emph{k}epsilon\{3,
4\}},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {69--80},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1929},
doi = {10.1006/JCTB.1999.1929},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kriesell00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ReedT00,
author = {Bruce A. Reed and
Robin Thomas},
title = {Clique Minors in Graphs and Their Complements},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {81--85},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1930},
doi = {10.1006/JCTB.1999.1930},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ReedT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/SarkozyS00,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {Vertex Partitions by Connected Monochromatic k-Regular Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {115--122},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1933},
doi = {10.1006/JCTB.1999.1933},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/SarkozyS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Tesler00,
author = {Glenn Tesler},
title = {Matchings in Graphs on Non-orientable Surfaces},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {2},
pages = {198--231},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1941},
doi = {10.1006/JCTB.1999.1941},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Tesler00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Yuster00,
author = {Raphael Yuster},
title = {Packing and Decomposition of Graphs with Trees},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {123--140},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1934},
doi = {10.1006/JCTB.1999.1934},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Yuster00.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-04 11:13 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:
