default search action
Search dblp for Publications
export results for "toc:db/journals/jct/jctb85.bht:"
@article{DBLP:journals/jct/BohmeMT02, author = {Thomas B{\"{o}}hme and Bojan Mohar and Carsten Thomassen}, title = {Long Cycles in Graphs on a Fixed Surface}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {338--347}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2108}, doi = {10.1006/JCTB.2001.2108}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BohmeMT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Bollobas02, author = {B{\'{e}}la Bollob{\'{a}}s}, title = {Evaluations of the Circuit Partition Polynomial}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {261--268}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2102}, doi = {10.1006/JCTB.2001.2102}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Bollobas02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BonningtonCMM02, author = {C. Paul Bonnington and Marston D. E. Conder and Margaret Morton and Patricia A. McKenna}, title = {Embedding Digraphs on Orientable Surfaces}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {1}, pages = {1--20}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2085}, doi = {10.1006/JCTB.2001.2085}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BonningtonCMM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BrualdiS02, author = {Richard A. Brualdi and Jian Shen}, title = {Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {189--196}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2094}, doi = {10.1006/JCTB.2001.2094}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BrualdiS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/CarvalhoLM02, author = {Marcelo Henriques de Carvalho and Cl{\'{a}}udio Leonardo Lucchesi and Uppaluri S. R. Murty}, title = {Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {1}, pages = {59--93}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2090}, doi = {10.1006/JCTB.2001.2090}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/CarvalhoLM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/CarvalhoLM02a, author = {Marcelo Henriques de Carvalho and Cl{\'{a}}udio Leonardo Lucchesi and Uppaluri S. R. Murty}, title = {On a Conjecture of Lov{\'{a}}sz Concerning Bricks: I. The Characteristic of a Matching Covered Graph}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {1}, pages = {94--136}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2091}, doi = {10.1006/JCTB.2001.2091}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/CarvalhoLM02a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/CarvalhoLM02b, author = {Marcelo Henriques de Carvalho and Cl{\'{a}}udio Leonardo Lucchesi and Uppaluri S. R. Murty}, title = {On a Conjecture of Lov{\'{a}}sz Concerning Bricks: {II.} Bricks of Finite Characteristic}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {1}, pages = {137--180}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2092}, doi = {10.1006/JCTB.2001.2092}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/CarvalhoLM02b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HonkalaL02a, author = {Iiro S. Honkala and Antoine Lobstein}, title = {On the Density of Identifying Codes in the Square Lattice}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {297--306}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2106}, doi = {10.1006/JCTB.2001.2106}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/HonkalaL02a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Ishigami02, author = {Yoshiyasu Ishigami}, title = {Proof of a Conjecture of Bolloba's and Kohayakawa on the Erds-Stone Theorem}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {222--254}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2097}, doi = {10.1006/JCTB.2001.2097}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Ishigami02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Jiang02, author = {Tao Jiang}, title = {Anti-Ramsey Numbers of Subdivided Graphs}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {361--366}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2105}, doi = {10.1006/JCTB.2001.2105}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Jiang02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/JohnsonT02, author = {Thor Johnson and Robin Thomas}, title = {Generating Internally Four-Connected Graphs}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {1}, pages = {21--58}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2089}, doi = {10.1006/JCTB.2001.2089}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/JohnsonT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Kawarabayashi02, author = {Ken{-}ichi Kawarabayashi}, title = {Contractible Edges and Triangles in k-Connected Graphs}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {207--221}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2096}, doi = {10.1006/JCTB.2001.2096}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Kawarabayashi02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KundgenR02, author = {Andr{\'{e}} K{\"{u}}ndgen and Radhika Ramamurthi}, title = {Coloring Face-Hypergraphs of Graphs on Surfaces}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {307--337}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2107}, doi = {10.1006/JCTB.2001.2107}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KundgenR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/LeachR02, author = {C. David Leach and Christopher A. Rodger}, title = {Fair Hamilton Decompositions of Complete Multipartite Graphs}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {290--296}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2104}, doi = {10.1006/JCTB.2001.2104}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/LeachR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/RuzsaTV02, author = {Imre Z. Ruzsa and Zsolt Tuza and Margit Voigt}, title = {Distance Graphs with Finite Chromatic Number}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {1}, pages = {181--187}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2093}, doi = {10.1006/JCTB.2001.2093}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/RuzsaTV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Sanders02, author = {Robin S. Sanders}, title = {Products of Circulant Graphs Are Metacirculant}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {197--206}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2095}, doi = {10.1006/JCTB.2001.2095}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Sanders02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/SandersZ02a, author = {Daniel P. Sanders and Yue Zhao}, title = {Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {348--360}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2109}, doi = {10.1006/JCTB.2001.2109}, timestamp = {Tue, 23 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/SandersZ02a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Schrijver02, author = {Alexander Schrijver}, title = {A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {255--260}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2101}, doi = {10.1006/JCTB.2001.2101}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Schrijver02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Wilson02, author = {Steve Wilson}, title = {Families of Regular Graphs in Regular Maps}, journal = {J. Comb. Theory {B}}, volume = {85}, number = {2}, pages = {269--289}, year = {2002}, url = {https://doi.org/10.1006/jctb.2001.2103}, doi = {10.1006/JCTB.2001.2103}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Wilson02.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.