Journal: Graphs and Combinatorics

Volume 27, Issue 6

769 -- 783Diptendu Bhowmick, L. Sunil Chandran. Boxicity of Circular Arc Graphs
785 -- 797Peter Borg. Maximum Hitting of a Set by Compressed Intersecting Families
799 -- 819Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn. Path-Bicolorable Graphs
821 -- 830Xue-Gang Chen, Moo Young Sohn. Domination Number of Graphs Without Small Cycles
831 -- 849Nathann Cohen, Frédéric Havet. Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree
851 -- 864Stefan Geschke, Menachem Kojman. Symmetrized Induced Ramsey Theory
865 -- 869Xinmin Hou. On the Perfect Matchings of Near Regular Graphs
871 -- 882M. M. Shikare, K. V. Dalvi, S. B. Dhotre. Splitting Off Operation for Binary Matroids and its Applications
883 -- 896Renwang Su, Lidong Wang. Minimum Resolvable Coverings of K v with Copies of K 4 - e

Volume 27, Issue 5

621 -- 646Dalibor Froncek, Petr Kovár, Michael Kubesa. Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices
647 -- 659Takuro Fukunaga. All 4-Edge-Connected HHD-Free Graphs are /mathbb::::Z::::::3::-Connected
661 -- 667Izolda Gorgol. Turán Numbers for Disjoint Copies of Graphs
669 -- 683Zhihong He, Yan Wang. Weakly Cycle Complementary 3-Partite Tournaments
685 -- 701Michael A. Henning, Anders Yeo. Perfect Matchings in Total Domination Critical Graphs
703 -- 711Yoshiko Ikebe, Akihisa Tamura. Construction of Hamilton Path Tournament Designs
713 -- 726Sandi Klavzar, Gasper Mekis. On Idomatic Partitions of Direct Products of Complete Graphs
727 -- 740Shuchao Li, Lixia Yan. Sums of Powers of the Degrees of Graphs with ::::k:::: Cut Edges
741 -- 754Jeremy Lyle. On the Chromatic Number of ::::H::::-Free Graphs of Large Minimum Degree
755 -- 768Vadim E. Zverovich, Anush Poghosyan. On Roman, Global and Restrained Domination in Graphs

Volume 27, Issue 4

475 -- 485Mustafa Atici, Claus Ernst. On the Range of Possible Integrities of Graphs ::::G::::(::::n::::, ::::k::::)
487 -- 493Rangaswami Balakrishnan, T. Kavaskar. Color Chain of a Graph
495 -- 503Emanuela Fachini, János Körner. Forbiddance and Capacity
505 -- 530Michael Goff. Higher Dimensional Moore Bounds
531 -- 538Nader Jafari Rad, Lutz Volkmann. On the Roman Bondage Number of Planar Graphs
539 -- 546Petteri Kaski, Veli Mäkinen, Patric R. J. Östergård. The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected
547 -- 556Kerri Morgan. Pairs of Chromatically Equivalent Graphs
557 -- 565Stavros D. Nikolopoulos, Charis Papadopoulos. A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
567 -- 584Pawel Pralat. Cleaning Random ::::d::::-Regular Graphs with Brooms
585 -- 591Ioan Tomescu, Muhammad Imran. Metric Dimension and ::::R::::-Sets of Connected Graphs
593 -- 602Jian Wang, Miao Liang, Beiliang Du. The Spectrum of Tetrahedral Quadruple Systems
603 -- 620Xiyong Zhang, Hua Guo, Zongsheng Gao. Characterizations of Bent and Almost Bent Function on /mathbb::::Z::::::::::p:::::::::2:::

Volume 27, Issue 3

305 -- 306Hiro Ito. Preface
307 -- 319Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam. Cutting a Convex Polyhedron Out of a Sphere
321 -- 326Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura. Arrangements of ::::n:::: Points whose Incident-Line-Numbers are at most ::::n::::/2
327 -- 339Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian. Colorful Strips
341 -- 351Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno. Algorithmic Folding Complexity
353 -- 362L. Sunil Chandran, Mathew C. Francis, Rogers Mathew. Chordal Bipartite Graphs with High Boxicity
363 -- 376Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O Rourke. Continuous Blooming of Convex Polyhedra
377 -- 397Erik D. Demaine, Martin L. Demaine, Vi Hart, Gregory N. Price, Tomohiro Tachi. (Non)Existence of Pleated Folds: How Paper Folds Between Creases
399 -- 411Adrian Dumitrescu, János Pach. Minimum Clique Partition in Unit Disk Graphs
413 -- 418Mikio Kano, Hiroo Kishimoto. Spanning ::::k::::-Trees of ::::n::::-Connected Graphs
419 -- 430Michael Kerber, Michael Sagraloff. A Note on the Complexity of Real Algebraic Hypersurfaces
431 -- 439Hiroshi Koizumi, Kokichi Sugihara. Maximum Eigenvalue Problem for Escherization
441 -- 450Takayasu Kuwata, Hiroshi Maehara. Lattice Points on Similar Figures and Conics
451 -- 463Hiroshi Maehara, Norihide Tokushige. Classification of the Congruent Embeddings of a Tetrahedron into a Triangular Prism
465 -- 473János Pach, Deniz Sariöz. On the Structure of Graphs with Low Obstacle Number

Volume 27, Issue 2

149 -- 160Robert A. Beeler, Robert E. Jamison. Automorphic Decompositions of Graphs
161 -- 170Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner. Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles
171 -- 175Vasek Chvátal. Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs
177 -- 186David Galvin, Yufei Zhao. The Number of Independent Sets in a Graph with Small Maximum Degree
187 -- 197Han Ren, Yanbo Gao. Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings of ::::K::::::12::::s::::+7::
199 -- 206Roman Kuzel, Jakub Teska. On 2-Connected Spanning Subgraphs with Bounded Degree in ::::K::::::1, ::::r::::::-Free Graphs
207 -- 214Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan. On 3-Edge-Connected Supereulerian Graphs
215 -- 229Arbind Kumar Lal, Kamal Lochan Patra, Binod Kumar Sahoo. Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices
231 -- 241Edita Mácajová, Martin Skoviera. Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7
243 -- 249Klas Markström, Andrew Thomason, Peter Wagner 0002. Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
251 -- 267Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat. Cleaning with Brooms
269 -- 273G. R. Omidi. A Note on Group Choosability of Graphs with Girth at least 4
275 -- 287Yingzhi Tian, Jixiang Meng. Superconnected and Hyperconnected Small Degree Transitive Graphs
289 -- 303Jun Yuan, Aixia Liu. The ::::k::::-Restricted Edge Connectivity of Balanced Bipartite Graphs

Volume 27, Issue 1

1 -- 26Kenta Ozeki, Tomoki Yamashita. Spanning Trees: A Survey
27 -- 46Sarmad Abbasi, Laeeq Aslam. The Cycle Discrepancy of Three-Regular Graphs
47 -- 60Zachary 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
61 -- 72L. Sunil Chandran, Mathew C. Francis, Rogers Mathew. Boxicity of Leaf Powers
73 -- 85Július Czap, Stanislav Jendrol, Frantisek Kardos, Jozef Miskuf. Looseness of Plane Graphs
87 -- 107Chris Dowden. Random Planar Graphs with Bounds on the Maximum and Minimum Degrees
109 -- 119Severino V. Gervacio, Hiroshi Maehara. A Note on Lights-Out-Puzzle: Parity-State Graphs
121 -- 128Tao Jiang, Michael Salerno. Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs
129 -- 141You Lu, Jun Ming Xu. The ::::p::::-Bondage Number of Trees
143 -- 148G. R. Vijayakumar. On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices