default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/gc/gc27.bht:"
download as .bib file
@article{DBLP:journals/gc/AbbasiA11,
author = {Sarmad Abbasi and
Laeeq Aslam},
title = {The Cycle Discrepancy of Three-Regular Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {27--46},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0964-3},
doi = {10.1007/S00373-010-0964-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AbbasiA11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AbelBBCDHKLPW11,
author = {Zachary Abel and
Brad Ballinger and
Prosenjit Bose and
S{\'{e}}bastien Collette and
Vida Dujmovic and
Ferran Hurtado and
Scott Duke Kominers and
Stefan Langerman and
Attila P{\'{o}}r and
David R. Wood},
title = {Every Large Point Set contains Many Collinear Points or an Empty Pentagon},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {47--60},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0957-2},
doi = {10.1007/S00373-010-0957-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AbelBBCDHKLPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AhmedHI11,
author = {Syed Ishtiaque Ahmed and
Masud Hasan and
Md. Ariful Islam},
title = {Cutting a Convex Polyhedron Out of a Sphere},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {307--319},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1018-1},
doi = {10.1007/S00373-011-1018-1},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AhmedHI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AkiyamaIKN11,
author = {Jin Akiyama and
Hiro Ito and
Midori Kobayashi and
Gisaku Nakamura},
title = {Arrangements of \emph{n} Points whose Incident-Line-Numbers are at
most \emph{n}/2},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {321--326},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1023-4},
doi = {10.1007/S00373-011-1023-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AkiyamaIKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AloupisCCIKLSST11,
author = {Greg Aloupis and
Jean Cardinal and
S{\'{e}}bastien Collette and
Shinji Imahori and
Matias Korman and
Stefan Langerman and
Oded Schwartz and
Shakhar Smorodinsky and
Perouz Taslakian},
title = {Colorful Strips},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {327--339},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1014-5},
doi = {10.1007/S00373-011-1014-5},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AloupisCCIKLSST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AticiE11,
author = {Mustafa Atici and
Claus Ernst},
title = {On the Range of Possible Integrities of Graphs \emph{G}(\emph{n},
\emph{k})},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {475--485},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0990-1},
doi = {10.1007/S00373-010-0990-1},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AticiE11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BalakrishnanK11,
author = {Rangaswami Balakrishnan and
T. Kavaskar},
title = {Color Chain of a Graph},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {487--493},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0989-7},
doi = {10.1007/S00373-010-0989-7},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BalakrishnanK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BeelerJ11,
author = {Robert A. Beeler and
Robert E. Jamison},
title = {Automorphic Decompositions of Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {149--160},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0981-2},
doi = {10.1007/S00373-010-0981-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BeelerJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BhowmickC11,
author = {Diptendu Bhowmick and
L. Sunil Chandran},
title = {Boxicity of Circular Arc Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {769--783},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1002-1},
doi = {10.1007/S00373-010-1002-1},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BhowmickC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BillingtonDHL11,
author = {Elizabeth J. Billington and
Italo J. Dejter and
Dean G. Hoffman and
Charles Curtis Lindner},
title = {Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {161--170},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0967-0},
doi = {10.1007/S00373-010-0967-0},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BillingtonDHL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Borg11,
author = {Peter Borg},
title = {Maximum Hitting of a Set by Compressed Intersecting Families},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {785--797},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1001-2},
doi = {10.1007/S00373-010-1001-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Borg11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrandstadtGLL11,
author = {Andreas Brandst{\"{a}}dt and
Martin Charles Golumbic and
Van Bang Le and
Marina Lipshteyn},
title = {Path-Bicolorable Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {799--819},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1007-9},
doi = {10.1007/S00373-010-1007-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrandstadtGLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/CardinalDDIIKLUU11,
author = {Jean Cardinal and
Erik D. Demaine and
Martin L. Demaine and
Shinji Imahori and
Tsuyoshi Ito and
Masashi Kiyomi and
Stefan Langerman and
Ryuhei Uehara and
Takeaki Uno},
title = {Algorithmic Folding Complexity},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {341--351},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1019-0},
doi = {10.1007/S00373-011-1019-0},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/CardinalDDIIKLUU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ChandranFM11,
author = {L. Sunil Chandran and
Mathew C. Francis and
Rogers Mathew},
title = {Boxicity of Leaf Powers},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {61--72},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0962-5},
doi = {10.1007/S00373-010-0962-5},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ChandranFM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ChandranFM11a,
author = {L. Sunil Chandran and
Mathew C. Francis and
Rogers Mathew},
title = {Chordal Bipartite Graphs with High Boxicity},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {353--362},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1017-2},
doi = {10.1007/S00373-011-1017-2},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ChandranFM11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ChenS11,
author = {Xue{-}Gang Chen and
Moo Young Sohn},
title = {Domination Number of Graphs Without Small Cycles},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {821--830},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1004-z},
doi = {10.1007/S00373-010-1004-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ChenS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Chvatal11,
author = {Vasek Chv{\'{a}}tal},
title = {Comparison of Two Techniques for Proving Nonexistence of Strongly
Regular Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {171--175},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0977-y},
doi = {10.1007/S00373-010-0977-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Chvatal11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/CohenH11,
author = {Nathann Cohen and
Fr{\'{e}}d{\'{e}}ric Havet},
title = {Linear and 2-Frugal Choosability of Graphs of Small Maximum Average
Degree},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {831--849},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1009-7},
doi = {10.1007/S00373-010-1009-7},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/CohenH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/CzapJKM11,
author = {J{\'{u}}lius Czap and
Stanislav Jendrol' and
Frantisek Kardos and
Jozef Miskuf},
title = {Looseness of Plane Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {73--85},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0961-6},
doi = {10.1007/S00373-010-0961-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/CzapJKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/DemaineDHILO11,
author = {Erik D. Demaine and
Martin L. Demaine and
Vi Hart and
John Iacono and
Stefan Langerman and
Joseph O'Rourke},
title = {Continuous Blooming of Convex Polyhedra},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {363--376},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1024-3},
doi = {10.1007/S00373-011-1024-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/DemaineDHILO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/DemaineDHPT11,
author = {Erik D. Demaine and
Martin L. Demaine and
Vi Hart and
Gregory N. Price and
Tomohiro Tachi},
title = {(Non)Existence of Pleated Folds: How Paper Folds Between Creases},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {377--397},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1025-2},
doi = {10.1007/S00373-011-1025-2},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/DemaineDHPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Dowden11,
author = {Chris Dowden},
title = {Random Planar Graphs with Bounds on the Maximum and Minimum Degrees},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {87--107},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0960-7},
doi = {10.1007/S00373-010-0960-7},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Dowden11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/DumitrescuP11,
author = {Adrian Dumitrescu and
J{\'{a}}nos Pach},
title = {Minimum Clique Partition in Unit Disk Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {399--411},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1026-1},
doi = {10.1007/S00373-011-1026-1},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/DumitrescuP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FachiniK11,
author = {Emanuela Fachini and
J{\'{a}}nos K{\"{o}}rner},
title = {Forbiddance and Capacity},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {495--503},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0987-9},
doi = {10.1007/S00373-010-0987-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FachiniK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FroncekKK11,
author = {Dalibor Froncek and
Petr Kov{\'{a}}r and
Michael Kubesa},
title = {Factorizations of Complete Graphs into Trees with at most Four Non-Leave
Vertices},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {621--646},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0991-0},
doi = {10.1007/S00373-010-0991-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FroncekKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Fukunaga11,
author = {Takuro Fukunaga},
title = {All 4-Edge-Connected HHD-Free Graphs are {\textbackslash}mathbb\emph{Z}\({}_{\mbox{3}}\)-Connected},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {647--659},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0995-9},
doi = {10.1007/S00373-010-0995-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Fukunaga11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GalvinZ11,
author = {David J. Galvin and
Yufei Zhao},
title = {The Number of Independent Sets in a Graph with Small Maximum Degree},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {177--186},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0976-z},
doi = {10.1007/S00373-010-0976-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GalvinZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GervacioM11,
author = {Severino Villanueva Gervacio and
Hiroshi Maehara},
title = {A Note on Lights-Out-Puzzle: Parity-State Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {109--119},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0958-1},
doi = {10.1007/S00373-010-0958-1},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GervacioM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GeschkeK11,
author = {Stefan Geschke and
Menachem Kojman},
title = {Symmetrized Induced Ramsey Theory},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {851--864},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1006-x},
doi = {10.1007/S00373-010-1006-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GeschkeK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Goff11,
author = {Michael Goff},
title = {Higher Dimensional Moore Bounds},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {505--530},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0979-9},
doi = {10.1007/S00373-010-0979-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Goff11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Gorgol11,
author = {Izolda Gorgol},
title = {Tur{\'{a}}n Numbers for Disjoint Copies of Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {661--667},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0999-5},
doi = {10.1007/S00373-010-0999-5},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Gorgol11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HeW11,
author = {Zhihong He and
Yan Wang},
title = {Weakly Cycle Complementary 3-Partite Tournaments},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {669--683},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0993-y},
doi = {10.1007/S00373-010-0993-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HeW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HenningY11,
author = {Michael A. Henning and
Anders Yeo},
title = {Perfect Matchings in Total Domination Critical Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {685--701},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1000-3},
doi = {10.1007/S00373-010-1000-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HenningY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Hou11,
author = {Xinmin Hou},
title = {On the Perfect Matchings of Near Regular Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {865--869},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1008-8},
doi = {10.1007/S00373-010-1008-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Hou11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/IkebeT11,
author = {Yoshiko Ikebe and
Akihisa Tamura},
title = {Construction of Hamilton Path Tournament Designs},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {703--711},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0998-6},
doi = {10.1007/S00373-010-0998-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/IkebeT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Ito11,
author = {Hiro Ito},
title = {Preface},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {305--306},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1013-6},
doi = {10.1007/S00373-011-1013-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Ito11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/JiangS11,
author = {Tao Jiang and
Michael Salerno},
title = {Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {121--128},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0959-0},
doi = {10.1007/S00373-010-0959-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/JiangS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KanoK11,
author = {Mikio Kano and
Hiroo Kishimoto},
title = {Spanning \emph{k}-Trees of \emph{n}-Connected Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {413--418},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1021-6},
doi = {10.1007/S00373-011-1021-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KanoK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KaskiMO11,
author = {Petteri Kaski and
Veli M{\"{a}}kinen and
Patric R. J. {\"{O}}sterg{\aa}rd},
title = {The Cycle Switching Graph of the Steiner Triple Systems of Order 19
is Connected},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {539--546},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0982-1},
doi = {10.1007/S00373-010-0982-1},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KaskiMO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KerberS11,
author = {Michael Kerber and
Michael Sagraloff},
title = {A Note on the Complexity of Real Algebraic Hypersurfaces},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {419--430},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1020-7},
doi = {10.1007/S00373-011-1020-7},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KerberS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KlavzarM11,
author = {Sandi Klavzar and
Gasper Mekis},
title = {On Idomatic Partitions of Direct Products of Complete Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {713--726},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0997-7},
doi = {10.1007/S00373-010-0997-7},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KlavzarM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KoizumiS11,
author = {Hiroshi Koizumi and
Kokichi Sugihara},
title = {Maximum Eigenvalue Problem for Escherization},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {431--439},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1022-5},
doi = {10.1007/S00373-011-1022-5},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KoizumiS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KuwataM11,
author = {Takayasu Kuwata and
Hiroshi Maehara},
title = {Lattice Points on Similar Figures and Conics},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {441--450},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1015-4},
doi = {10.1007/S00373-011-1015-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KuwataM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KuzelT11,
author = {Roman Kuzel and
Jakub Teska},
title = {On 2-Connected Spanning Subgraphs with Bounded Degree in \emph{K}\({}_{\mbox{1,
\emph{r}}}\)-Free Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {199--206},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1011-0},
doi = {10.1007/S00373-010-1011-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KuzelT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LaiLSZ11,
author = {Hong{-}Jian Lai and
Hao Li and
Yehong Shao and
Mingquan Zhan},
title = {On 3-Edge-Connected Supereulerian Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {207--214},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0974-1},
doi = {10.1007/S00373-010-0974-1},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LaiLSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LalPS11,
author = {Arbind Kumar Lal and
Kamal Lochan Patra and
Binod Kumar Sahoo},
title = {Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant
Vertices},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {215--229},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0975-0},
doi = {10.1007/S00373-010-0975-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LalPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LiY11,
author = {Shuchao Li and
Lixia Yan},
title = {Sums of Powers of the Degrees of Graphs with \emph{k} Cut Edges},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {727--740},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0996-8},
doi = {10.1007/S00373-010-0996-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LiY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LuX11,
author = {You Lu and
Jun{-}Ming Xu},
title = {The \emph{p}-Bondage Number of Trees},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {129--141},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0956-3},
doi = {10.1007/S00373-010-0956-3},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LuX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Lyle11,
author = {Jeremy Lyle},
title = {On the Chromatic Number of \emph{H}-Free Graphs of Large Minimum Degree},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {741--754},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0994-x},
doi = {10.1007/S00373-010-0994-X},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Lyle11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/MacajovaS11,
author = {Edita M{\'{a}}cajov{\'{a}} and
Martin Skoviera},
title = {Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {231--241},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0968-z},
doi = {10.1007/S00373-010-0968-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/MacajovaS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/MaeharaT11,
author = {Hiroshi Maehara and
Norihide Tokushige},
title = {Classification of the Congruent Embeddings of a Tetrahedron into a
Triangular Prism},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {451--463},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1016-3},
doi = {10.1007/S00373-011-1016-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/MaeharaT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/MarkstromT011,
author = {Klas Markstr{\"{o}}m and
Andrew Thomason and
Peter Wagner},
title = {Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {243--249},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0970-5},
doi = {10.1007/S00373-010-0970-5},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/MarkstromT011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/MessingerNP11,
author = {Margaret{-}Ellen Messinger and
Richard J. Nowakowski and
Pawel Pralat},
title = {Cleaning with Brooms},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {251--267},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0965-2},
doi = {10.1007/S00373-010-0965-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/MessingerNP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Morgan11,
author = {Kerri Morgan},
title = {Pairs of Chromatically Equivalent Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {547--556},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0984-z},
doi = {10.1007/S00373-010-0984-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Morgan11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/NikolopoulosP11,
author = {Stavros D. Nikolopoulos and
Charis Papadopoulos},
title = {A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold
Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {557--565},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0983-0},
doi = {10.1007/S00373-010-0983-0},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/NikolopoulosP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Omidi11,
author = {G. R. Omidi},
title = {A Note on Group Choosability of Graphs with Girth at least 4},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {269--273},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0971-4},
doi = {10.1007/S00373-010-0971-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Omidi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/OzekiY11,
author = {Kenta Ozeki and
Tomoki Yamashita},
title = {Spanning Trees: {A} Survey},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {1--26},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0973-2},
doi = {10.1007/S00373-010-0973-2},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/OzekiY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/PachS11,
author = {J{\'{a}}nos Pach and
Deniz Sari{\"{o}}z},
title = {On the Structure of Graphs with Low Obstacle Number},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {465--473},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1027-0},
doi = {10.1007/S00373-011-1027-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/PachS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Pralat11,
author = {Pawel Pralat},
title = {Cleaning Random \emph{d}-Regular Graphs with Brooms},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {567--584},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0986-x},
doi = {10.1007/S00373-010-0986-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Pralat11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/RadV11,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {On the Roman Bondage Number of Planar Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {531--538},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0978-x},
doi = {10.1007/S00373-010-0978-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/RadV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/RenG11,
author = {Han Ren and
Yanbo Gao},
title = {Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings
of \emph{K}\({}_{\mbox{12\emph{s}+7}}\)},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {187--197},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0969-y},
doi = {10.1007/S00373-010-0969-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/RenG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ShikareDD11,
author = {M. M. Shikare and
K. V. Dalvi and
Santosh Baburao Dhotre},
title = {Splitting Off Operation for Binary Matroids and its Applications},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {871--882},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1005-y},
doi = {10.1007/S00373-010-1005-Y},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ShikareDD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/SuW11,
author = {Renwang Su and
Lidong Wang},
title = {Minimum Resolvable Coverings of {K} v with Copies of {K} 4 - e},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {883--896},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1003-0},
doi = {10.1007/S00373-010-1003-0},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/SuW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/TianM11,
author = {Yingzhi Tian and
Jixiang Meng},
title = {Superconnected and Hyperconnected Small Degree Transitive Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {275--287},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0972-3},
doi = {10.1007/S00373-010-0972-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/TianM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/TomescuI11,
author = {Ioan Tomescu and
Muhammad Imran},
title = {Metric Dimension and \emph{R}-Sets of Connected Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {585--591},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0988-8},
doi = {10.1007/S00373-010-0988-8},
timestamp = {Fri, 24 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/TomescuI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Vijayakumar11,
author = {Gurusamy Rengasamy Vijayakumar},
title = {On Partitioning the Edge Set of a Graph into Internally Disjoint Paths
without Exterior Vertices},
journal = {Graphs Comb.},
volume = {27},
number = {1},
pages = {143--148},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0963-4},
doi = {10.1007/S00373-010-0963-4},
timestamp = {Mon, 30 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Vijayakumar11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/WangLD11,
author = {Jian Wang and
Miao Liang and
Beiliang Du},
title = {The Spectrum of Tetrahedral Quadruple Systems},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {593--602},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0985-y},
doi = {10.1007/S00373-010-0985-Y},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/WangLD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/YuanL11,
author = {Jun Yuan and
Aixia Liu},
title = {The \emph{k}-Restricted Edge Connectivity of Balanced Bipartite Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {2},
pages = {289--303},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0966-1},
doi = {10.1007/S00373-010-0966-1},
timestamp = {Fri, 30 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/YuanL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ZhangGG11,
author = {Xiyong Zhang and
Hua Guo and
Zongsheng Gao},
title = {Characterizations of Bent and Almost Bent Function on {\textbackslash}mathbb\emph{Z}\({}_{\mbox{\emph{p}}}\)\({}^{\mbox{2}}\)},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {603--620},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0980-3},
doi = {10.1007/S00373-010-0980-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ZhangGG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ZverovichP11,
author = {Vadim E. Zverovich and
Anush Poghosyan},
title = {On Roman, Global and Restrained Domination in Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {5},
pages = {755--768},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0992-z},
doi = {10.1007/S00373-010-0992-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ZverovichP11.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 2024-12-23 19:49 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:
