default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 27
Volume 27, Number 1, January 2011
- Kenta Ozeki
, Tomoki Yamashita:
Spanning Trees: A Survey. 1-26 - Sarmad Abbasi, Laeeq Aslam:
The Cycle Discrepancy of Three-Regular Graphs. 27-46 - Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. 47-60 - L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
Boxicity of Leaf Powers. 61-72 - Július Czap, Stanislav Jendrol', Frantisek Kardos, Jozef Miskuf:
Looseness of Plane Graphs. 73-85 - Chris Dowden:
Random Planar Graphs with Bounds on the Maximum and Minimum Degrees. 87-107 - Severino Villanueva Gervacio, Hiroshi Maehara:
A Note on Lights-Out-Puzzle: Parity-State Graphs. 109-119 - Tao Jiang, Michael Salerno:
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs. 121-128 - You Lu, Jun-Ming Xu:
The p-Bondage Number of Trees. 129-141 - Gurusamy Rengasamy Vijayakumar:
On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices. 143-148
Volume 27, Number 2, March 2011
- Robert A. Beeler, Robert E. Jamison:
Automorphic Decompositions of Graphs. 149-160 - Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner:
Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles. 161-170 - Vasek Chvátal:
Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs. 171-175 - David J. Galvin, Yufei Zhao:
The Number of Independent Sets in a Graph with Small Maximum Degree. 177-186 - Han Ren, Yanbo Gao:
Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings of K12s+7. 187-197 - Roman Kuzel, Jakub Teska:
On 2-Connected Spanning Subgraphs with Bounded Degree in K1, r-Free Graphs. 199-206 - Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan:
On 3-Edge-Connected Supereulerian Graphs. 207-214 - Arbind Kumar Lal, Kamal Lochan Patra, Binod Kumar Sahoo:
Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices. 215-229 - Edita Mácajová, Martin Skoviera:
Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7. 231-241 - Klas Markström, Andrew Thomason, Peter Wagner:
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. 243-249 - Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat:
Cleaning with Brooms. 251-267 - G. R. Omidi:
A Note on Group Choosability of Graphs with Girth at least 4. 269-273 - Yingzhi Tian, Jixiang Meng:
Superconnected and Hyperconnected Small Degree Transitive Graphs. 275-287 - Jun Yuan, Aixia Liu:
The k-Restricted Edge Connectivity of Balanced Bipartite Graphs. 289-303
Volume 27, Number 3, May 2011
- Hiro Ito:
Preface. 305-306 - Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam:
Cutting a Convex Polyhedron Out of a Sphere. 307-319 - Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura:
Arrangements of n Points whose Incident-Line-Numbers are at most n/2. 321-326 - Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. 327-339 - Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno:
Algorithmic Folding Complexity. 341-351 - L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
Chordal Bipartite Graphs with High Boxicity. 353-362 - Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke:
Continuous Blooming of Convex Polyhedra. 363-376 - Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price, Tomohiro Tachi:
(Non)Existence of Pleated Folds: How Paper Folds Between Creases. 377-397 - Adrian Dumitrescu, János Pach:
Minimum Clique Partition in Unit Disk Graphs. 399-411 - Mikio Kano, Hiroo Kishimoto:
Spanning k-Trees of n-Connected Graphs. 413-418 - Michael Kerber, Michael Sagraloff:
A Note on the Complexity of Real Algebraic Hypersurfaces. 419-430 - Hiroshi Koizumi, Kokichi Sugihara:
Maximum Eigenvalue Problem for Escherization. 431-439 - Takayasu Kuwata, Hiroshi Maehara:
Lattice Points on Similar Figures and Conics. 441-450 - Hiroshi Maehara, Norihide Tokushige:
Classification of the Congruent Embeddings of a Tetrahedron into a Triangular Prism. 451-463 - János Pach, Deniz Sariöz:
On the Structure of Graphs with Low Obstacle Number. 465-473
Volume 27, Number 4, July 2011
- Mustafa Atici, Claus Ernst:
On the Range of Possible Integrities of Graphs G(n, k). 475-485 - Rangaswami Balakrishnan, T. Kavaskar:
Color Chain of a Graph. 487-493 - Emanuela Fachini, János Körner:
Forbiddance and Capacity. 495-503 - Michael Goff:
Higher Dimensional Moore Bounds. 505-530 - Nader Jafari Rad, Lutz Volkmann:
On the Roman Bondage Number of Planar Graphs. 531-538 - Petteri Kaski, Veli Mäkinen, Patric R. J. Östergård:
The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected. 539-546 - Kerri Morgan:
Pairs of Chromatically Equivalent Graphs. 547-556 - Stavros D. Nikolopoulos, Charis Papadopoulos:
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. 557-565 - Pawel Pralat:
Cleaning Random d-Regular Graphs with Brooms. 567-584 - Ioan Tomescu, Muhammad Imran:
Metric Dimension and R-Sets of Connected Graphs. 585-591 - Jian Wang, Miao Liang, Beiliang Du:
The Spectrum of Tetrahedral Quadruple Systems. 593-602 - Xiyong Zhang, Hua Guo, Zongsheng Gao:
Characterizations of Bent and Almost Bent Function on \mathbbZp2. 603-620
Volume 27, Number 5, September 2011
- Dalibor Froncek, Petr Kovár, Michael Kubesa:
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices. 621-646 - Takuro Fukunaga:
All 4-Edge-Connected HHD-Free Graphs are \mathbbZ3-Connected. 647-659 - Izolda Gorgol:
Turán Numbers for Disjoint Copies of Graphs. 661-667 - Zhihong He, Yan Wang:
Weakly Cycle Complementary 3-Partite Tournaments. 669-683 - Michael A. Henning, Anders Yeo:
Perfect Matchings in Total Domination Critical Graphs. 685-701 - Yoshiko Ikebe, Akihisa Tamura:
Construction of Hamilton Path Tournament Designs. 703-711 - Sandi Klavzar, Gasper Mekis:
On Idomatic Partitions of Direct Products of Complete Graphs. 713-726 - Shuchao Li, Lixia Yan:
Sums of Powers of the Degrees of Graphs with k Cut Edges. 727-740 - Jeremy Lyle:
On the Chromatic Number of H-Free Graphs of Large Minimum Degree. 741-754 - Vadim E. Zverovich, Anush Poghosyan:
On Roman, Global and Restrained Domination in Graphs. 755-768
Volume 27, Number 6, November 2011
- Diptendu Bhowmick, L. Sunil Chandran:
Boxicity of Circular Arc Graphs. 769-783 - Peter Borg:
Maximum Hitting of a Set by Compressed Intersecting Families. 785-797 - Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. 799-819 - Xue-Gang Chen, Moo Young Sohn:
Domination Number of Graphs Without Small Cycles. 821-830 - Nathann Cohen, Frédéric Havet:
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. 831-849 - Stefan Geschke, Menachem Kojman:
Symmetrized Induced Ramsey Theory. 851-864 - Xinmin Hou:
On the Perfect Matchings of Near Regular Graphs. 865-869 - M. M. Shikare, K. V. Dalvi, Santosh Baburao Dhotre:
Splitting Off Operation for Binary Matroids and its Applications. 871-882 - Renwang Su, Lidong Wang:
Minimum Resolvable Coverings of K v with Copies of K 4 - e. 883-896
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.
last updated on 2024-09-25 00:32 CEST 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:
