default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 22
Volume 22, Number 1, 2008
- Tomás Feder, Pavol Hell, Jing Huang:
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. 1-14 - Eleni Tzanaki:
Faces of Generalized Cluster Complexes and Noncrossing Partitions. 15-30 - William P. Orrick
:
Switching Operations for Hadamard Matrices. 31-50 - Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for Square-3PC(., .)-Free Berge Graphs. 51-71 - Hajo Broersma, Agostino Capponi, Daniël Paulusma:
A New Algorithm for On-line Coloring Bipartite Graphs. 72-91 - Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
Average Distance and Edge-Connectivity I. 92-101 - Isolde Adler:
Tree-Related Widths of Graphs and Hypergraphs. 102-123 - Gruia Calinescu, Adrian Dumitrescu, János Pach:
Reconfigurations in Graphs and Grids. 124-138 - Zdenek Dvorák, Riste Skrekovski, Martin Tancer:
List-Coloring Squares of Sparse Subcubic Graphs. 139-159 - Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer:
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees. 160-184 - Dániel Gerbner, Balázs Patkós:
l-Chain Profile Vectors. 185-193 - Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Planarity, Colorability, and Minor Games. 194-212 - Jeong-Hyun Kang:
L(2, 1)-Labeling of Hamiltonian graphs with Maximum Degree 3. 213-230 - Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski:
3-Facial Coloring of Plane Graphs. 231-247 - Jun Wang, Huajun Zhang:
Normalized Matching Property of Restricted Subspace Lattices. 248-255 - Navin Kashyap:
Matroid Pathwidth and Code Trellis Complexity. 256-272 - Marko J. Moisio:
On the Duals of Binary Hyper-Kloosterman Codes. 273-287 - Genghua Fan, Chuixiang Zhou:
Ore Condition and Nowhere-Zero 3-Flows. 288-294 - Jirí Matousek, Ales Prívetivý:
Large Monochromatic Components in Two-Colored Grids. 295-311 - Andrei A. Krokhin, Benoît Larose:
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction. 312-328 - Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
On Planar Quasi-Parity Graphs. 329-347 - Mei-Chu Chang, Chui Zhi Yao:
An Explicit Bound On Double Exponential Sums Related to Diffie--Hellman Distributions. 348-359 - Amos Beimel, Tamir Tassa, Enav Weinreb:
Characterizing Ideal Weighted Threshold Secret Sharing. 360-397 - Alexandr V. Kostochka, Xuding Zhu:
Adapted List Coloring of Graphs and Hypergraphs. 398-408 - Min Chih Lin, Jayme Luiz Szwarcfiter:
Unit Circular-Arc Graph Representations and Feasible Circulations. 409-423
Volume 22, Number 2, 2008
- Reza Akhtar, Tao Jiang, Zevi Miller:
Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs. 425-449 - David Offner:
Polychromatic Colorings of Subcubes of the Hypercube. 450-454 - Dillon Mayhew:
Matroid Complexity and Nonsuccinct Descriptions. 455-466 - Vojtech Rödl, Mark H. Siggers:
On Ramsey Minimal Graphs. 467-488 - János Körner, Claudia Malvenuto, Gábor Simonyi:
Graph-Different Permutations. 489-499 - Rong Luo, Rui Xu, Wenan Zang, Cun-Quan Zhang:
Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows. 500-519 - Prasad Chebolu, Alan M. Frieze:
Hamilton Cycles in Random Lifts of Directed Graphs. 520-540 - Daniel Král, Matej Stehlík:
Coloring of Triangle-Free Graphs on the Double Torus. 541-553 - Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon Spacapan:
Power Domination in Product Graphs. 554-567 - Zdenek Dvorák, Riste Skrekovski, Tomás Valla:
Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. 568-591 - Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Hat Guessing Games. 592-605 - Angel Corberán, Isaac Plana, José M. Sanchis:
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra. 606-628 - Shlomo Ahal, Yuri Rabinovich:
On Complexity of the Subpattern Problem. 629-649 - Pascale Charpin, Gohar M. Kyureghyan:
Cubic Monomial Bent Functions: A Subclass of M. 650-665 - Sang-il Oum:
Rank-Width and Well-Quasi-Ordering. 666-682 - Chris D. Godsil, Michael W. Newman:
Coloring an Orthogonality Graph. 683-692 - Uriel Feige, Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph. 693-718 - Brendan D. McKay, Ian M. Wanless:
A Census of Small Latin Hypercubes. 719-736 - D. Siersma, M. van Manen:
The Nine Morse Generic Tetrahedra. 737-746 - Josep Díaz, Xavier Pérez-Giménez, Maria J. Serna, Nicholas C. Wormald:
Walkers on the Cycle and the Grid. 747-775 - David Eisenstat, Gary Gordon, Amanda Redlich:
Combinatorial Properties of a Rooted Graph Polynomial. 776-785 - Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron:
Testing Triangle-Freeness in General Graphs. 786-819 - Landon Rabern:
A Note On Reed's Conjecture. 820-827 - Rom Pinchasi:
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane. 828-831 - Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
On the Complexity of Ordered Colorings. 832-847
Volume 22, Number 3, 2008
- Zsolt Tuza:
Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs. 849-853 - Jácint Szabó:
Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski. 854-860 - Tomás Kaiser, Riste Skrekovski:
Cycles Intersecting Edge-Cuts of Prescribed Sizes. 861-874 - Nathan Reading:
Chains in the Noncrossing Partition Lattice. 875-886 - József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu:
On the First-Fit Chromatic Number of Graphs. 887-900 - Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn:
Nonlinear Matroid Optimization and Experimental Design. 901-919 - Paul S. Bonsma:
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three. 920-937 - Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray:
Near-Unanimity Functions and Varieties of Reflexive Graphs. 938-960 - Bhalchandra D. Thatte:
Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question. 961-970 - Heping Zhang, Peter Che Bor Lam, Wai Chee Shiu:
Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems. 971-984 - Russell Kirk, Hua Wang:
Largest Number of Subtrees of Trees with a Given Maximum Degree. 985-995 - Jerrold R. Griggs, Xiaohua Teresa Jin:
Real Number Channel Assignments for Lattices. 996-1021 - Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot:
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. 1022-1039 - Susan S. Wang:
Structure and Coloring of Graphs with Only Small Odd Cycles. 1040-1072 - Michael Armbruster, Christoph Helmberg, Marzena Fügenschuh, Alexander Martin:
On the Graph Bisection Cut Polytope. 1073-1098 - William Y. C. Chen, Deheng Xu:
Labeled Partitions and the q-Derangement Numbers. 1099-1104 - Masao Ishikawa, Anisse Kasraoui, Jiang Zeng:
Euler--Mahonian Statistics on Ordered Set Partitions. 1105-1137 - Hemanshu Kaul, Douglas B. West:
Long Local Searches for Maximal Bipartite Subgraphs. 1138-1144 - József Solymosi, Konrad J. Swanepoel:
Elementary Incidence Theorems for Complex Numbers and Quaternions. 1145-1148 - Paul Balister, Béla Bollobás, Stefanie Gerke:
Sequences with Changing Dependencies. 1149-1154 - Ádám Timár:
Split Hypergraphs. 1155-1163 - Maria Chudnovsky, Rohan Kapadia:
Detecting a Theta or a Prism. 1164-1186 - Csaba D. Tóth:
Axis-Aligned Subdivisions with Low Stabbing Numbers. 1187-1204 - K. P. Webb:
The Vector Space over GF(2) Generated by the Common Bases of Two Binary Matroids. 1205-1214 - Vladimir Ejov, Jerzy A. Filar, Walter Murray, Giang T. Nguyen:
Determinants and Longest Cycles of Graphs. 1215-1225 - Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Isometric Embeddings of Subdivided Complete Graphs in the Hypercube. 1226-1238 - Cyril Gavoille, Christophe Paul:
Optimal Distance Labeling for Interval Graphs and Related Graph Families. 1239-1258
Volume 22, Number 4, 2008
- Derek G. Corneil, Richard Krueger:
A Unified View of Graph Searching. 1259-1276 - Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm. 1277-1296 - Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur:
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach. 1297-1324 - Noga Alon, Michael Krivelevich, Benny Sudakov:
Large Nearly Regular Induced Subgraphs. 1325-1337 - Olof Heden:
Perfect Codes of Length n with Kernels of Dimension n-log(n+1)-3. 1338-1350 - Camino Balbuena:
Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices. 1351-1363 - Xin He, Huaming Zhang:
Nearly Optimal Visibility Representations of Plane Graphs. 1364-1380 - Henning Bruhn, Xingxing Yu:
Hamilton Cycles in Planar Locally Finite Graphs. 1381-1392 - Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng:
Prolific Codes with the Identifiable Parent Property. 1393-1410 - Satoru Iwata, Kenjiro Takazawa:
The Independent Even Factor Problem. 1411-1427 - Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
Multidimensional Manhattan Street Networks. 1428-1447 - Tomás Dvorák, Petr Gregor:
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices. 1448-1461 - Lukasz Kowalik, Jean-Sébastien Sereni, Riste Skrekovski:
Total-Coloring of Plane Graphs with Maximum Degree Nine. 1462-1479 - Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis:
Odd Minimum Cut Sets and b-Matchings Revisited. 1480-1487 - Federica Garin, Fabio Fagnani:
Analysis of Serial Turbo Codes over Abelian Groups for Symmetric Channels. 1488-1526 - David E Speyer:
Tropical Linear Spaces. 1527-1558 - Daniel Král, Petr Skoda:
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice. 1559-1569 - Xiao Zhou, Takao Nishizeki:
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. 1570-1604 - Jirí Matousek, Ales Prívetivý, Petr Skovron:
How Many Points Can Be Reconstructed from k Projections? 1605-1623 - Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. 1624-1639 - Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub:
On the Polytope of the (1, 2)-Survivable Network Design Problem. 1640-1666
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 2025-01-09 19:20 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:
