default search action
Graphs and Combinatorics, Volume 23
Volume 23, Number 1, February 2007
- Ken-ichi Kawarabayashi, Bojan Mohar:
Some Recent Progress and Applications in Graph Minor Theory. 1-46 - Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
:
Bicolored Matchings in Some Classes of Graphs. 47-60 - Krzysztof Kolodziejczyk:
Realizable Quadruples for Hex-polygons - Combinatorics of honeycombs. 61-72 - Jianmin Ma:
Three-Class Association Schemes on Galois Rings in Characteristic 4. 73-86 - Atsuhiro Nakamoto
3-Colorable Even Embeddings on Closed Surfaces. 87-95 - Yuejian Peng:
Non-Jumping Numbers for 4-Uniform Hypergraphs. 97-110 - Andrea Vietri:
Difference Families in Z2d+1(+)Z2d+1 and Infinite Translation Designs in Z(+)Z. 111-121
Volume 23, Number 2, April 2007
- Maria Axenovich, Heiko Harborth, Arnfried Kemnitz, Meinhard Möller, Ingo Schiermeyer:
Rainbows in the Hypercube. 123-133 - David Forge, Mekkia Kouider:
Coverings of the Vertices of a Graph by Small Cycles. 135-143 - Dalibor Froncek
Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5. 145-163 - Ronald J. Gould, Thor Whalen:
Subdivision Extendibility. 165-182 - Goran Kilibarda:
Enumeration of Unlabelled Mating Graphs. 183-199 - Chiang Lin:
Simple Proofs of Results on Paths Representing All Colors in Proper Vertex-Colorings. 201-203 - Stefko Miklavic, Primoz Potocnik, Steve Wilson:
Consistent Cycles in Graphs and Digraphs. 205-216 - Dávid Pál, Martin Skoviera:
Colouring Cubic Graphs by Small Steiner Triple Systems. 217-228
Volume 23, Number 3, June 2007
- sarah-marie belcastro
Families of Dot-Product Snarks on Orientable Surfaces of Low Genus. 229-240 - Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deying Li:
An s -Hamiltonian Line Graph Problem. 241-248 - David Conlon
On the Existence of Rainbow 4-Term Arithmetic Progressions. 249-254 - Jinquan Dong, Yanpei Liu:
On the Decomposition of Graphs into Complete Bipartite Graphs. 255-262 - Michael Ferrara:
Graphic Sequences with a Realization Containing a Union of Cliques. 263-269 - Gennian Ge, Malcolm Greig, Jennifer Seberry, Ralph Seberry:
Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups. 271-290 - Vincent Jost
Precoloring Extension of Co-Meyniel Graphs. 291-301 - Tomás Kaiser
A Note on k -walks in Bridgeless Graphs. 303-308 - Xiaodong Liang, Jixiang Meng, Zhao Zhang:
Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs. 309-314 - Giuseppe Mazzuoccolo
k -Pyramidal One-Factorizations. 315-326 - Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Chong Cui:
On the Crossing Number of K m P n . 327-336 - David R. Wood
On the Maximum Number of Cliques in a Graph. 337-352
Volume 23, Number 4, August 2007
- Attila Bernáth, Dániel Gerbner
Chain Intersecting Families. 353-366 - Bart De Bruyn, Harm Pralle
On Small and Large Hyperplanes of DW (5, q ). 367-380 - Weiting Cao, Kyung-Won Hwang, Douglas B. West:
Improved Bounds on Families Under k -wise Set-Intersection Constraints. 381-386 - Frank Göring
Local Topological Toughness and Local Factors. 387-399 - Masaaki Harada, Wolf H. Holzmann, Hadi Kharaghani, M. Khorvash:
Extremal Ternary Self-Dual Codes Constructed from Negacirculant Matrices. 401-417 - Alexandr V. Kostochka, Gexin Yu:
An Ore-type analogue of the Sauer-Spencer Theorem. 419-424 - Ping Li, Guizhen Liu:
Cycles in Circuit Graphs of Matroids. 425-431 - Huiqing Liu, Mei Lu, Feng Tian:
Relative Length of Longest Paths and Cycles in Graphs. 433-443 - Shariefuddin Pirzada
Score Lists in Tripartite Hypertournaments. 445-454 - Hiroaki Taniguchi:
On an Isomorphism Problem of Some Dual Hyperovals in PG (2 d + 1, q ) with q even. 455-465
Volume 23, Number 5, October 2007
- Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer
Gray Code Enumeration of Plane Straight-Line Graphs. 467-479 - Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles. 481-507 - Chuanping Chen, Roman Cada
Short Disjoint Paths in Locally Connected Graphs. 509-519 - Yichao Chen, Yanpei Liu:
Up-Embeddability of a Graph by Order and Girth. 521-527 - Jochen Harant, Stanislav Jendrol'
On the Existence of Specific Stars in Planar Graphs. 529-543 - Matthias Kriesell:
On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree. 545-557 - Nigel Martin:
Unbalanced Star-Factorizations of Complete Bipartite Graphs II. 559-583 - Masao Tsugaki, Tomoki Yamashita:
Spanning Trees with Few Leaves. 585-598
Volume 23, Number 6, December 2007
- Bart De Bruyn, Pieter Vandecasteele:
The Valuations of the Near Octagon \mathbbH4{\mathbb{H}}_4. 601-623 - Kinkar Chandra Das:
A Sharp Upper Bound for the Number of Spanning Trees of a Graph. 625-632 - Marina Groshaus, Jayme Luiz Szwarcfiter:
Biclique-Helly Graphs. 633-645 - Michael A. Henning, Anders Yeo:
Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph. 647-657 - Ling Tang, Shengxiang Lv, Yuanqiu Huang:
The Crossing Number of Cartesian Products of Complete Bipartite Graphs K 2, m with Paths P n . 659-666 - Dhruv Mubayi, Yi Zhao:
Forbidding Complete Hypergraphs as Traces. 667-679 - Oleg Pikhurko:
Characterization of Product Anti-Magic Graphs of Large Order. 681-689 - Benjamin R. Smith:
Equipartite Gregarious 5-Cycle Systems and Other Results. 691-711 - Renee Woo, Arnold Neumaier
On Graphs Whose Spectral Radius is Bounded by \frac32Ö2\frac{3}{2}\sqrt{2}. 713-726
Volume 23, Number Supplement-1, June 2007
- David Avis:
Preface. - Mikio Kano, Mari-Jo P. Ruiz, Jorge Urrutia:
Jin Akiyama: A Friend and His Mathematics. 1-39 - David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed:
Vašek Chvátal: A Very Short Introduction. 41-65 - Oswin Aichholzer, Thomas Hackl, Clemens Huemer
On the Number of Plane Geometric Graphs. 67-84 - Victor Alvarez, Toshinori Sakai, Jorge Urrutia:
Bichromatic Quadrangulations with Steiner Points. 85-98 - Kiyoshi Ando, Yoshimi Egawa:
Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four. 99-115 - David Avis, Naoki Katoh, Makoto Ohsaki
Enumerating Non-crossing Minimally Rigid Frameworks. 117-134 - Sheng Bau, Akira Saito:
Reduction for 3-Connected Graphs of Minimum Degree at Least Four. 135-144 - Hervé Brönnimann, Jonathan Lenchner, János Pach:
Opposite-Quadrant Depth in the Plane. 145-152 - Xiaomin Chen, Bin Tian, Lei Wang:
Santa Claus' Towers of Hanoi. 153-167 - Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman
Efficient Many-To-Many Point Matching in One Dimension. 169-178 - Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Epsilon-Unfolding Orthogonal Polyhedra. 179-194 - Erik D. Demaine, Martin L. Demaine:
Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity. 195-208 - Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
An O(n 3)-Time Recognition Algorithm for hhds-free Graphs. 209-231 - Matteo Fischetti, Andrea Lodi:
MIPping Closures: An Instant Survey. 233-243 - Greg N. Frederickson:
Unexpected Twists in Geometric Dissections. 245-258 - Hiroshi Fukuda, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider:
A Method to Generate Polyominoes and Polyiamonds for Tilings with Rotational Symmetry. 259-267 - Ryan B. Hayward:
The Story of Perfectly Orderable Graphs. 269-273 - Pavol Hell, Jarik Nesetril
On the Density of Trigraph Homomorphisms. 275-281 - Hiro Ito, Midori Kobayashi, Gisaku Nakamura:
Semi-Distance Codes and Steiner Systems. 283-290 - Hiro Ito, Gisaku Nakamura, Satoshi Takata:
Winning Ways of Weighted Poset Games. 291-306 - Hiroshi Maehara:
On Configurations of Solid Balls in 3-Space: Chromatic Numbers and Knotted Cycles. 307-320 - David Rappaport:
Maximal Area Sets and Harmony. 321-329 - Sambuddha Roy, William Steiger:
Some Combinatorial and Algorithmic Applications of the Borsuk-Ulam Theorem. 331-341 - Toshinori Sakai, Jorge Urrutia:
Covering the Convex Quadrilaterals of Point Sets. 343-357 - Takeshi Tokuyama
Recent Progress on Combinatorics and Algorithms for Low Discrepancy Roundings. 359-378
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-11-22 19:45 CET 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: