default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 312
Volume 312, Number 1, January 2012
- Pavol Hell, Wilfried Imrich
, Jaroslav Nesetril:
Preface. 1 - Aleksandar Ilic, Sandi Klavzar, Yoomi Rho:
Generalized Fibonacci cubes. 2-11 - Peter Dankelmann:
Average distance in weighted graphs. 12-20 - Reinhard Diestel, Philipp Sprüssel:
Locally finite graphs with ends: A topological approach, III. Fundamental group and homology. 21-29 - Charles C. Lindner, Alexander Rosa:
Extra two-fold Steiner pentagon systems. 30-34 - Richard C. Brewster, Jonathan A. Noel:
Extending precolourings of circular cliques. 35-41 - Aviezri S. Fraenkel:
The vile, dopey, evil and odious game players. 42-46 - Norbert Polat:
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity. 47-60 - Norbert Polat:
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes. 61-73 - Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler:
Diagonalized Cartesian products of s-prime graphs are s-prime. 74-80 - Ron Aharoni, Eli Berger, Ran Ziv:
The edge covering number of the intersection of two matroids. 81-85 - Ashraf Daneshkhah, Alice Devillers, Cheryl E. Praeger:
Symmetry properties of subdivision graphs. 86-93 - Heather Macbeth, Jana Siagiová, Jozef Sirán:
Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups. 94-99 - Ivo L. Hofacker, Christian M. Reidys, Peter F. Stadler:
Symmetric circular matchings and RNA folding. 100-112 - Brian Alspach, Darryn E. Bryant, Danny Dyer:
Paley graphs have Hamilton decompositions. 113-118 - Norbert W. Sauer:
Vertex partitions of metric spaces with finite distance sets. 119-128 - Chris D. Godsil:
State transfer on graphs. 129-147 - Ryan B. Hayward, Bjarne Toft, Philip Henderson:
How to play Reverse Hex. 148-156 - Wolfgang Woess:
Context-free pairs of groups II - Cuts, tree sets, and random walks. 157-173 - Xiao-Dong Zhang, Cun-Quan Zhang:
Kotzig frames and circuit double covers. 174-180 - Ignasi Sau, Petra Sparl, Janez Zerovnik:
Simpler multicoloring of triangle-free hexagonal graphs. 181-187 - Shehzad Afzal, Clemens Brand:
Recognizing triangulated Cartesian graph products. 188-193
Volume 312, Number 2, January 2012
- Giorgio Ragusa, Antoinette Tripodi:
Minimum embedding of a KS(u, lambda) into a KS(u+w, µ). 195-201 - Roman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto:
2-factors and independent sets on claw-free graphs. 202-206 - Byeong Moon Kim, Yoomi Rho, Byung Chul Song, Woonjae Hwang:
The maximum radius of graphs with given order and minimum degree. 207-212 - Artur Khojabaghyan, Vahan V. Mkrtchyan:
On upper bounds for parameters related to the construction of special maximum matchings. 213-220 - Rikio Ichishima, Susana-Clara López, Francesc A. Muntaner-Batle, Miquel Rius-Font:
The power of digraph products applied to labelings. 221-228 - Florian Pfender:
Total edge irregularity strength of large graphs. 229-237 - Miguel Couceiro, Erkko Lehtonen, Tamás Waldhauser:
Decompositions of functions based on arity gap. 238-247 - Emanuele Delucchi, Aaron Pixton, Lucas Sabalka:
Face vectors of subdivided simplicial complexes. 248-257 - Jun-Yang Zhang:
Regular embeddings of Cartesian product graphs. 258-264 - Kazuyoshi Suzuki:
Complete m-spotty weight enumerators of binary codes, Jacobi forms, and partial Epstein zeta functions. 265-278 - Valentin Féray, Ekaterina A. Vassilieva:
Bijective enumeration of some colored permutations given by the product of two long cycles. 279-292 - Wannasiri Wannasit, Saad I. El-Zanati:
On cyclic G-designs where G is a cubic tripartite graph. 293-305 - Oleg V. Borodin, Anna O. Ivanova:
List 2-facial 5-colorability of plane graphs with girth at least 12. 306-314 - Teresa W. Haynes, Michael A. Henning, Anders Yeo:
On a conjecture of Murty and Simon on diameter two critical graphs II. 315-323 - T. Karthick, Frédéric Maffray:
A characterization of claw-free b-perfect graphs. 324-330 - Xiaomiao Wang, Yanxun Chang:
Further results on optimal (v, 4, 2, 1)-OOCs. 331-340 - Yanxun Chang, Fan Yang, Junling Zhou:
The existence spectrum for (3, λ)-GDDs of type gtu1. 341-350 - Juliane Lehmann, Olof Heden:
Some necessary conditions for vector space partitions. 351-361 - Min Chen, Mickaël Montassier, André Raspaud:
Some structural properties of planar graphs and their applications to 3-choosability. 362-373 - Jochen Harant, Stanislav Jendrol':
Nonrepetitive vertex colorings of graphs. 374-380 - V. Chitra, Appu Muthusamy:
Bipartite variation of the cheesecake factory problem: mH(k, 2l+1)-factorization of Kn, n. 381-389 - Ahmed Ainouche:
alpha-degree closures for graphs. 390-396 - Michael A. Henning, Lucas C. van der Merwe:
The maximum diameter of total domination edge-critical graphs. 397-404 - Shi-Mei Ma:
Derivative polynomials and enumeration of permutations by number of interior and left peaks. 405-412 - Le Anh Vinh:
Singular matrices with restricted rows in vector spaces over finite fields. 413-418 - Seunghyun Seo, Heesung Shin:
On the enumeration of rooted trees with fixed size of maximal decreasing trees. 419-426 - Andrei Asinowski, Bernard Ries:
Some properties of edge intersection graphs of single-bend paths on a grid. 427-440 - Dmitry A. Shabanov:
On r-chromatic hypergraphs. 441-458 - Michael Ferrara, Michael S. Jacobson, Jeffrey S. Powell:
Characterizing degree-sum maximal nonhamiltonian bipartite graphs. 459-461 - Sandi Klavzar, Sergey V. Shpectorov:
Characterizing almost-median graphs II. 462-464 - Lutz Volkmann:
Signed 2-independence in digraphs. 465-471 - Tomás Vetrík:
Large Cayley digraphs of given degree and diameter. 472-475 - Vahan V. Mkrtchyan, Eckhard Steffen:
Measures of edge-uncolorability. 476-478 - Wen Li, Dianhua Wu, Fengchu Pan:
A construction for doubly pandiagonal magic squares. 479-485
Volume 312, Number 3, February 2012
- Mario Gionfriddo, Guglielmo Lunardon, Norma Zagaglia Salvi:
Preface. 487 - Luca Giuzzi, Anita Pasotti:
Sampling complete designs. 488-497 - Hiroaki Taniguchi:
Quotients of the deformation of Veronesean dual hyperoval in PG(3d, 2). 498-508 - Salvatore Milici, Giorgio Ragusa, Fulvio Zuanni:
Small embedding of an S3(2, 4, u) into an Sλ(2, 4, u+w). 509-516 - Gaetano Quattrocchi, Giorgio Ragusa:
Exact embedding of two G-designs into a (G+e)-design. 517-523 - Jin-ichi Itoh, Costin Vîlcu:
Cut locus structures on graphs. 524-531 - Luca Giuzzi, Gábor Korchmáros:
Unitals in PG(2, q2) with a large 2-point stabiliser. 532-535 - Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, Violet R. Syrotiuk:
Grooming traffic to minimize load. 536-544 - Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi:
The fine triangle intersection problem for kite systems. 545-553 - Bart De Bruyn:
On sets of odd type of PG(n, 4) and the universal embedding of the dual polar space DH(2n-1, 4). 554-560 - Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
3-consecutive edge coloring of a graph. 561-573 - Elliot Krop, Sin-Min Lee, Christopher Raridan:
On the number of unlabeled vertices in edge-friendly labelings of graphs. 574-577 - Andrea Pavan, Corrado Zanella:
On linear partial spreads. 578-583 - Kenjiro Ogawa, Ryoko Soejima, Satoshi Tagusari, Morimasa Tsuchiya:
Note on strict-double-bound numbers of nearly complete graphs missing some edges. 584-587 - Vadim E. Levit, Eugen Mandrescu:
On local maximum stable set greedoids. 588-596 - Ales Drápal, Andrew R. Kozlik, Terry S. Griggs:
Latin directed triple systems. 597-607 - Kramer Alpar-Vajk:
A particular Hamiltonian cycle on middle levels in the De Bruijn digraph. 608-613 - Luigia Berardi, Mario Gionfriddo, Rosaria Rota:
Perfect octagon quadrangle systems - II. 614-620 - Patric R. J. Östergård:
Switching codes and designs. 621-632 - Luigia Berardi, Mario Gionfriddo, Rosaria Rota:
Balanced and strongly balanced Pk-designs. 633-636 - Alberto Picone:
On the classification of algebraic function fields of class number three. 637-646 - Antonio Cossidente, Angelo Sonnino:
Linear codes arising from the Gale transform of distinguished subsets of some projective spaces. 647-651 - Corrado Zanella:
On finite Steiner surfaces. 652-656 - Hans-Joachim Kroll, Rita Vincenti:
How to find small AI-systems for antiblocking decoding. 657-665 - Natalia N. Tokareva:
Duality between bent functions and affine functions. 666-670 - Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi:
Minimally contraction-critically 6-connected graphs. 671-679 - Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco:
On sizes of complete arcs in PG(2, q). 680-698 - Roberta Di Gennaro, Eva Ferrara Dentice, Pia Maria Lo Re:
On the Grassmann space representing the lines of an affine space. 699-704 - Kris Coolsaet:
The Lemma of Tangents reformulated. 705-714
Volume 312, Number 4, February 2012
- Elad Horev, Matthew J. Katz, Roi Krakovski, Atsuhiro Nakamoto:
Polychromatic 4-coloring of cubic bipartite plane graphs. 715-719 - Guixin Deng, Pingzhi Yuan:
On the symmetric digraphs from powers modulo n. 720-728 - Mathieu Dutour Sikiric, Martin Knor, Primoz Potocnik, Jozef Sirán, Riste Skrekovski:
Hyperbolic analogues of fullerenes on orientable surfaces. 729-736 - J. García-López, Carlos Marijuán:
Minimal strong digraphs. 737-744 - Melissa S. Keranen, Melanie R. Laffin:
Fixed block configuration group divisible designs with block size six. 745-756 - Aubin Jarry, Alexandre Laugier:
On the minimum number of edges of two-connected graphs with given diameter. 757-762 - Gabe Cunningham:
Mixing regular convex polytopes. 763-771 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. 772-788 - Zemin Jin, Shili Wen, Shujun Zhou:
Heterochromatic tree partition problem in complete tripartite graphs. 789-802 - Feng Ming Dong:
A new expression for matching polynomials. 803-807 - Ferenc Péterfalvi:
Two counterexamples on completely independent spanning trees. 808-810
Volume 312, Number 5, March 2012
- Katalin Gyarmati, Christian Mauduit:
On the correlation of binary sequences, II. 811-818 - Jianbin Zhang, Bo Zhou, Zhongzhu Liu:
On the minimal eccentric connectivity indices of graphs. 819-829 - Jonathan Chappelon, Akihiro Matsuura:
On generalized Frame-Stewart numbers. 830-836 - David E. Roberson:
Häggkvist-Hell graphs: A class of Kneser-colorable graphs. 837-853 - R. Julian R. Abel, Frank E. Bennett:
Existence of 2 SOLS and 2 ISOLS. 854-867 - Frank E. Bennett, Hantao Zhang:
Schröder quasigroups with a specified number of idempotents. 868-882 - Bart De Bruyn:
On the universal embedding of the near hexagon related to the extended ternary Golay code. 883-890 - Shengning Qiao:
Neighborhood unions and disjoint chorded cycles in graphs. 891-897 - Andrew Berget, Jia Huang:
Cyclic sieving of finite Grassmannians and flag varieties. 898-910 - Daniela A. Amato, David M. Evans, John Kenneth Truss:
Classification of some countable descendant-homogeneous digraphs. 911-919 - Lijun Ji:
Existence of Steiner quadruple systems with a spanning block design. 920-932 - Ruth Haas, Michael Young:
The anti-Ramsey number of perfect matching. 933-937 - Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito:
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. 938-942 - Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez:
Cover starters for covering arrays of strength two. 943-956 - Lee Williams, Jennifer Vandenbussche, Gexin Yu:
Equitable defective coloring of sparse planar graphs. 957-962 - Carl Johan Casselgren:
On avoiding some families of arrays. 963-972 - Seiya Negami:
The distinguishing numbers of graphs on closed surfaces. 973-991 - Kinkar Chandra Das:
Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs. 992-998 - Xin Zhang, Guizhen Liu, Jianliang Wu:
1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs. 999-1005 - Jiangmin Pan, Xue Yu, Hua Zhang, Zhaohong Huang:
Finite edge-transitive dihedrant graphs. 1006-1012 - Zhaohong Niu, Hong-Jian Lai, Liming Xiong:
Spanning subgraph with Eulerian components. 1013-1018 - Kittikorn Nakprasit:
Equitable colorings of planar graphs with maximum degree at least nine. 1019-1024 - Aline Castro, Michel Mollard:
The eccentricity sequences of Fibonacci and Lucas cubes. 1025-1037 - Axel Bacher:
Average site perimeter of directed animals on the two-dimensional lattices. 1038-1058 - Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Yunqing Zhang:
A theorem on cycle-wheel Ramsey number. 1059-1061 - Niema Aboluion, Derek H. Smith, Stephanie Perkins:
Linear and nonlinear constructions of DNA codes with Hamming distance 1-s2.0-S0012365X11005280-si18, constant GC-content and a reverse-complement constraint. 1062-1075 - Abdollah Alimadadi, Changiz Eslahchi, Teresa W. Haynes, Michael A. Henning, Nader Jafari Rad, Lucas C. van der Merwe:
Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371]. 1076
Volume 312, Number 6, March 2012
- Genghua Fan, Baogang Xu, Xingxing Yu, Chuixiang Zhou:
Upper bounds on minimum balanced bipartitions. 1077-1083 - Petr Kovár, Michael Kubesa, Mariusz Meszka:
Factorizations of complete graphs into brooms. 1084-1093 - Martin Knor, Primoz Potocnik, Riste Skrekovski:
On a conjecture about Wiener index in iterated line graphs of trees. 1094-1105 - Marcel Abas:
Generalized Cayley maps and Hamiltonian maps of complete graphs. 1106-1116 - Janusz Adamus, Lech Adamus:
A degree condition for cycles of maximum length in bipartite digraphs. 1117-1122 - Akira Kamibeppu:
A sufficient condition for Kim's conjecture on the competition numbers of graphs. 1123-1127 - Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud:
(k, 1)-coloring of sparse graphs. 1128-1135 - Manouchehr Zaker:
On dynamic monopolies of graphs with general thresholds. 1136-1143 - Benjian Lv, Kaishun Wang:
The eigenvalues of q-Kneser graphs. 1144-1147 - Liliana Alcón, Marisa Gutierrez:
Finding intersection models: From chordal to Helly circular-arc graphs. 1148-1157 - Reza Akhtar, Anthony B. Evans, Dan Pritikin:
Representation numbers of complete multipartite graphs. 1158-1165