default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jgt/jgt32.bht:"
download as .bib file
@article{DBLP:journals/jgt/BaloghP99,
author = {J{\'{o}}zsef Balogh and
Andr{\'{a}}s Pluh{\'{a}}r},
title = {A sharp edge bound on the interval number of a graph},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {153--159},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\<153::AID-JGT5\>3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199910)32:2\<153::AID-JGT5\>3.0.CO;2-P},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BaloghP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BohmeHT99,
author = {Thomas B{\"{o}}hme and
Jochen Harant and
Michal Tk{\'{a}}c},
title = {On certain Hamiltonian cycles in planar graphs},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {81--96},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\<81::AID-JGT8\>3.0.CO;2-9},
doi = {10.1002/(SICI)1097-0118(199909)32:1\<81::AID-JGT8\>3.0.CO;2-9},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BohmeHT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BohmeHT99a,
author = {Thomas B{\"{o}}hme and
Jochen Harant and
Michal Tk{\'{a}}c},
title = {More than one tough chordal planar graphs are Hamiltonian},
journal = {J. Graph Theory},
volume = {32},
number = {4},
pages = {405--410},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199912)32:4\<405::AID-JGT8\>3.0.CO;2-Z},
doi = {10.1002/(SICI)1097-0118(199912)32:4\<405::AID-JGT8\>3.0.CO;2-Z},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BohmeHT99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BohmeMS99,
author = {Thomas B{\"{o}}hme and
Bojan Mohar and
Michael Stiebitz},
title = {Dirac's map-color theorem for choosability},
journal = {J. Graph Theory},
volume = {32},
number = {4},
pages = {327--339},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199912)32:4\<327::AID-JGT2\>3.0.CO;2-B},
doi = {10.1002/(SICI)1097-0118(199912)32:4\<327::AID-JGT2\>3.0.CO;2-B},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BohmeMS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BoironSV99,
author = {Pierre Boiron and
{\'{E}}ric Sopena and
Laurence Vignal},
title = {Acrylic improper colorings of graphs},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {97--107},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\<97::AID-JGT9\>3.0.CO;2-O},
doi = {10.1002/(SICI)1097-0118(199909)32:1\<97::AID-JGT9\>3.0.CO;2-O},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BoironSV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Cameron99,
author = {Peter J. Cameron},
title = {SGDs with doubly transitive automorphism group},
journal = {J. Graph Theory},
volume = {32},
number = {3},
pages = {229--233},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199911)32:3\<229::AID-JGT2\>3.0.CO;2-C},
doi = {10.1002/(SICI)1097-0118(199911)32:3\<229::AID-JGT2\>3.0.CO;2-C},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Cameron99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaroP99,
author = {Yair Caro and
Christian Provstgaard},
title = {Zero-sum delta-systems and multiple copies of graphs},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {207--216},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\<207::AID-JGT9\>3.0.CO;2-3},
doi = {10.1002/(SICI)1097-0118(199910)32:2\<207::AID-JGT9\>3.0.CO;2-3},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CaroP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Chappell99,
author = {Glenn G. Chappell},
title = {A lower bound for partial list colorings},
journal = {J. Graph Theory},
volume = {32},
number = {4},
pages = {390--393},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199912)32:4\<390::AID-JGT6\>3.0.CO;2-D},
doi = {10.1002/(SICI)1097-0118(199912)32:4\<390::AID-JGT6\>3.0.CO;2-D},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Chappell99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DengP99,
author = {Xiaotie Deng and
Christos H. Papadimitriou},
title = {Exploring an unknown graph},
journal = {J. Graph Theory},
volume = {32},
number = {3},
pages = {265--297},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199911)32:3\<265::AID-JGT6\>3.0.CO;2-8},
doi = {10.1002/(SICI)1097-0118(199911)32:3\<265::AID-JGT6\>3.0.CO;2-8},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DengP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DiestelK99,
author = {Reinhard Diestel and
Daniela K{\"{u}}hn},
title = {A universal planar graph under the minor relation},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {191--206},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\<191::AID-JGT8\>3.0.CO;2-I},
doi = {10.1002/(SICI)1097-0118(199910)32:2\<191::AID-JGT8\>3.0.CO;2-I},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DiestelK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DuM99,
author = {Shao{-}Fei Du and
Dragan Marusic},
title = {An infinite family of biprimitive semisymmetric graphs},
journal = {J. Graph Theory},
volume = {32},
number = {3},
pages = {217--228},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199911)32:3\<217::AID-JGT1\>3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0118(199911)32:3\<217::AID-JGT1\>3.0.CO;2-M},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DuM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HakimiS99,
author = {S. Louis Hakimi and
Edward F. Schmeichel},
title = {Improved bounds for the chromatic index of graphs and multigraphs},
journal = {J. Graph Theory},
volume = {32},
number = {4},
pages = {311--326},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199912)32:4\<311::AID-JGT1\>3.0.CO;2-X},
doi = {10.1002/(SICI)1097-0118(199912)32:4\<311::AID-JGT1\>3.0.CO;2-X},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HakimiS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hammack99,
author = {Richard H. Hammack},
title = {Cyclicity of graphs},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {160--170},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\<160::AID-JGT6\>3.0.CO;2-U},
doi = {10.1002/(SICI)1097-0118(199910)32:2\<160::AID-JGT6\>3.0.CO;2-U},
timestamp = {Sun, 22 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hammack99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hlineny99,
author = {Petr Hlinen{\'{y}}},
title = {A note on possible extensions of Negami's conjecture},
journal = {J. Graph Theory},
volume = {32},
number = {3},
pages = {234--240},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199911)32:3\<234::AID-JGT3\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199911)32:3\<234::AID-JGT3\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hlineny99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HuangC99,
author = {Lingling Huang and
Gerard J. Chang},
title = {The circular chromatic number of the Mycielskian of \emph{G}},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {63--71},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\<63::AID-JGT6\>3.0.CO;2-B},
doi = {10.1002/(SICI)1097-0118(199909)32:1\<63::AID-JGT6\>3.0.CO;2-B},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HuangC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Hudson99,
author = {John F. P. Hudson},
title = {Distinguishing two graph-encoded manifolds of Lins},
journal = {J. Graph Theory},
volume = {32},
number = {3},
pages = {298--302},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199911)32:3\<298::AID-JGT7\>3.0.CO;2-U},
doi = {10.1002/(SICI)1097-0118(199911)32:3\<298::AID-JGT7\>3.0.CO;2-U},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Hudson99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jelen99,
author = {Frank Jelen},
title = {\emph{k}-Independence and the \emph{k}-residue of a graph},
journal = {J. Graph Theory},
volume = {32},
number = {3},
pages = {241--249},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199911)32:3\<241::AID-JGT4\>3.0.CO;2-S},
doi = {10.1002/(SICI)1097-0118(199911)32:3\<241::AID-JGT4\>3.0.CO;2-S},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Jelen99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JiangW99,
author = {Tao Jiang and
Douglas B. West},
title = {Coloring of trees with minimum sum of colors},
journal = {J. Graph Theory},
volume = {32},
number = {4},
pages = {354--358},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199912)32:4\<354::AID-JGT4\>3.0.CO;2-B},
doi = {10.1002/(SICI)1097-0118(199912)32:4\<354::AID-JGT4\>3.0.CO;2-B},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JiangW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JuvanMS99,
author = {Martin Juvan and
Bojan Mohar and
Riste Skrekovski},
title = {Graphs of degree 4 are 5-edge-choosable},
journal = {J. Graph Theory},
volume = {32},
number = {3},
pages = {250--264},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199911)32:3\<250::AID-JGT5\>3.0.CO;2-R},
doi = {10.1002/(SICI)1097-0118(199911)32:3\<250::AID-JGT5\>3.0.CO;2-R},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JuvanMS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KiersteadSS99,
author = {Hal A. Kierstead and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {On \emph{k}-ordered Hamiltonian graphs},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {17--25},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\<17::AID-JGT2\>3.0.CO;2-G},
doi = {10.1002/(SICI)1097-0118(199909)32:1\<17::AID-JGT2\>3.0.CO;2-G},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KiersteadSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Kriesell99,
author = {Matthias Kriesell},
title = {On a conjecture of Thomassen and Toft},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {118--122},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\<118::AID-JGT2\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199910)32:2\<118::AID-JGT2\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Kriesell99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LinSW99,
author = {In{-}Jen Lin and
Malay K. Sen and
Douglas B. West},
title = {Intersection representation of digraphs in trees with few leaves},
journal = {J. Graph Theory},
volume = {32},
number = {4},
pages = {340--353},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199912)32:4\<340::AID-JGT3\>3.0.CO;2-R},
doi = {10.1002/(SICI)1097-0118(199912)32:4\<340::AID-JGT3\>3.0.CO;2-R},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LinSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/PiwakowskiRU99,
author = {Konrad Piwakowski and
Stanislaw P. Radziszowski and
Sebastian Urbanski},
title = {Computation of the Folkman number \emph{F\({}_{\mbox{e}}\)}(3, 3;
5)},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {41--49},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\<41::AID-JGT4\>3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199909)32:1\<41::AID-JGT4\>3.0.CO;2-P},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/PiwakowskiRU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Rizzi99,
author = {Romeo Rizzi},
title = {Indecomposable \emph{r}-graphs and some other counterexamples},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {1--15},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\<1::AID-JGT1\>3.0.CO;2-B},
doi = {10.1002/(SICI)1097-0118(199909)32:1\<1::AID-JGT1\>3.0.CO;2-B},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Rizzi99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Rusu99,
author = {Irena Rusu},
title = {Berge graphs with chordless cycles of bounded length},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {73--79},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\<73::AID-JGT7\>3.0.CO;2-7},
doi = {10.1002/(SICI)1097-0118(199909)32:1\<73::AID-JGT7\>3.0.CO;2-7},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Rusu99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Rusu99a,
author = {Irena Rusu},
title = {Perfectly contractile diamond-free graphs},
journal = {J. Graph Theory},
volume = {32},
number = {4},
pages = {359--389},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199912)32:4\<359::AID-JGT5\>3.0.CO;2-U},
doi = {10.1002/(SICI)1097-0118(199912)32:4\<359::AID-JGT5\>3.0.CO;2-U},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Rusu99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/RyjacekSS99,
author = {Zdenek Ryj{\'{a}}cek and
Akira Saito and
Richard H. Schelp},
title = {Closure, 2-factors, and cycle coverings in claw-free graphs},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {109--117},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\<109::AID-JGT1\>3.0.CO;2-O},
doi = {10.1002/(SICI)1097-0118(199910)32:2\<109::AID-JGT1\>3.0.CO;2-O},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/RyjacekSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Saito99,
author = {Akira Saito},
title = {Degree sums and graphs that are not covered by two cycles},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {51--61},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\<51::AID-JGT5\>3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0118(199909)32:1\<51::AID-JGT5\>3.0.CO;2-L},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Saito99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Tanenbaum99,
author = {Paul J. Tanenbaum},
title = {Simultaneous intersection representation of pairs of graphs},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {171--190},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\<171::AID-JGT7\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199910)32:2\<171::AID-JGT7\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Tanenbaum99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wagler99,
author = {Annegret Wagler},
title = {On critically perfect graphs},
journal = {J. Graph Theory},
volume = {32},
number = {4},
pages = {394--404},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199912)32:4\<394::AID-JGT7\>3.0.CO;2-Z},
doi = {10.1002/(SICI)1097-0118(199912)32:4\<394::AID-JGT7\>3.0.CO;2-Z},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wagler99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Yeo99,
author = {Anders Yeo},
title = {Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {123--136},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\<123::AID-JGT3\>3.0.CO;2-Y},
doi = {10.1002/(SICI)1097-0118(199910)32:2\<123::AID-JGT3\>3.0.CO;2-Y},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Yeo99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Yeo99a,
author = {Anders Yeo},
title = {Diregular \emph{c}-partite tournaments are vertex-pancyclic when \emph{c}
{\(\geq\)} 5},
journal = {J. Graph Theory},
volume = {32},
number = {2},
pages = {137--152},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199910)32:2\<137::AID-JGT4\>3.0.CO;2-I},
doi = {10.1002/(SICI)1097-0118(199910)32:2\<137::AID-JGT4\>3.0.CO;2-I},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Yeo99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Yuster99,
author = {Raphael Yuster},
title = {Decomposing large graphs with small graphs of high density},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {27--40},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\<27::AID-JGT3\>3.0.CO;2-C},
doi = {10.1002/(SICI)1097-0118(199909)32:1\<27::AID-JGT3\>3.0.CO;2-C},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Yuster99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Zverovich99,
author = {Igor E. Zverovich},
title = {\emph{k}-Bounded classes of dominant-independent perfect graphs},
journal = {J. Graph Theory},
volume = {32},
number = {3},
pages = {303--310},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199911)32:3\<303::AID-JGT8\>3.0.CO;2-B},
doi = {10.1002/(SICI)1097-0118(199911)32:3\<303::AID-JGT8\>3.0.CO;2-B},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Zverovich99.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.
retrieved on 2025-01-04 05:12 CET 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:
