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 - Kerri Morgan, Graham Farr:
Non-bipartite chromatic factors. 1166-1170 - Maolin Hu, Yongxi Cheng, Weidong Xu:
A generalization of Boesch's theorem. 1171-1177 - Paul S. Bonsma, Florian Zickfeld:
Improved bounds for spanning trees with many leaves. 1178-1194 - Thao Dô, Bill Sands:
Chop vectors and the lattice of integer partitions. 1195-1200 - Marianne Morillon, Patricia Spinelli:
Nash equilibria and values through modular partitions in infinite games. 1201-1212 - Eyal Ackerman, Rom Pinchasi:
On the light side of geometric graphs. 1213-1217 - Susumu Cato:
Complements and consistent closures. 1218-1221 - Young Soo Kwon, Jaeun Lee, Zhongfu Zhang:
Edge-chromatic numbers of Mycielski graphs. 1222-1225 - Guantao Chen, Katsuhiro Ota, Akira Saito, Yi Zhao:
Hamiltonian cycles with all small even chords. 1226-1240 - Jian-Hua Yin, Xiao-Fei Huang:
A Gale-Ryser type characterization of potentially 1-s2.0-S0012365X1100584X-si1-bigraphic pairs. 1241-1243 - Pee Choon Toh:
Ramanujan type identities and congruences for partition pairs. 1244-1250 - Jaromy Scott Kuhl, Tristan Denley:
Constrained completion of partial latin squares. 1251-1256 - Fulvio Zuanni:
A characterization of the external lines of a hyperoval in PG(3, q), q even. 1257-1259 - Rui Li, Baogang Xu:
Injective choosability of planar graphs of girth five and six. 1260-1265 - Min Feng, Kaishun Wang:
On the metric dimension of bilinear forms graphs. 1266-1268 - Vladimir N. Potapov:
On perfect 2-colorings of the q-ary n-cube. 1269-1272 - Alexandr V. Kostochka, Landon Rabern, Michael Stiebitz:
Graphs with chromatic number close to maximum degree. 1273-1281 - Eric Rowland, Jeffrey O. Shallit:
Avoiding 3/2-powers over the natural numbers. 1282-1288 - Eli Bagno, Yonah Cherniavsky:
Congruence B-orbits and the Bruhat poset of involutions of the symmetric group. 1289-1299 - Zhicong Lin, Jiang Zeng:
On the number of congruence classes of paths. 1300-1307
Volume 312, Number 7, April 2012
- Manoel Lemos:
On matroids with few circuits containing a pair of elements. 1309-1313 - Michael Drew Lamar:
Split digraphs. 1314-1325 - Michael Brand:
Tightening the bounds on the Baron's Omni-sequence. 1326-1335 - Paul B. Larson, Nicholas Matteo, Saharon Shelah:
Majority decisions when abstention is possible. 1336-1352 - Palanivel Subramania Nadar Paulraja, S. Sampath Kumar:
Closed trail decompositions of some classes of regular graphs. 1353-1366 - Nur Inayah, Anna S. Lladó, Jordi Moragas:
Magic and antimagic H-decompositions. 1367-1371 - Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
Colouring vertices of triangle-free graphs without forests. 1372-1385 - Chun-Hung Liu, Gerard Jennhwa Chang:
Upper bounds on Roman domination numbers of graphs. 1386-1391
Volume 312, Number 8, April 2012
- Rafael R. Kamalian, Petros A. Petrosyan:
A note on upper bounds for the maximum span in interval edge-colorings of graphs. 1393-1399 - Daqing Yang:
Coloring games on squares of graphs. 1400-1406 - Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total labeling problem for trees. 1407-1420 - Nancy E. Clarke, Gary MacGillivray:
Characterizations of k-copwin graphs. 1421-1425 - Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer:
On the recognition of fuzzy circular interval graphs. 1426-1435 - Endre Boros, Ondrej Cepek, Vladimir Gurvich:
Total tightness implies Nash-solvability for three-person game forms. 1436-1443 - Emmanuel Lecouturier, David Zmiaikou:
On a conjecture of H. Gupta. 1444-1452 - Hengzhe Li, Xueliang Li, Sujuan Liu:
Rainbow connection of graphs with diameter 2. 1453-1457 - Ruixia Wang:
A conjecture on k-transitive digraphs. 1458-1460 - Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi, Junling Zhou:
Overlarge sets of resolvable idempotent quasigroups. 1461-1467 - Gerard Jennhwa Chang, Daphne Der-Fen Liu:
Strong edge-coloring for cubic Halin graphs. 1468-1475 - Diana Avella-Alaminos, Ernesto Vallejo:
Kronecker products and the RSK correspondence. 1476-1486 - Füsun Akman, Papa Amar Sissokho:
The lattice of finite subspace partitions. 1487-1491
Volume 312, Number 9, May 2012
- R. Balakrishnan, R. B. Bapat, Sandi Klavzar, Ambat Vijayakumar, Thomas Zaslavsky, Xuding Zhu:
Preface. 1493 - Michael D. Barrus, Stephen G. Hartke, Kyle F. Jao, Douglas B. West:
Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps. 1494-1501 - Stephan G. Wagner:
On the Wiener index of random trees. 1502-1511 - Bor-Liang Chen, Chih-Hung Yen:
Equitable Δ-coloring of graphs. 1512-1517 - Ervin Györi, Nathan Lemons:
Hypergraphs with no cycle of length 4. 1518-1520 - Andreas M. Hinz, Daniele Parisse:
Coloring Hanoi and Sierpiński graphs. 1521-1535 - Hsin-Hao Lai, Ko-Wei Lih, Ping-Ying Tsai:
The strong chromatic index of Halin graphs. 1536-1541 - Manas Joglekar, Nisarg Shah, Ajit A. Diwan:
Balanced group-labeled graphs. 1542-1549 - Laxman Saha, Pratima Panigrahi:
Antipodal number of some powers of cycles. 1550-1557 - Thomas Zaslavsky:
Six signed Petersen graphs, and their automorphisms. 1558-1583 - S. Arumugam, Varughese Mathew:
The fractional metric dimension of graphs. 1584-1590
Volume 312, Number 10, May 2012
- Jiang Zhou, Changjiang Bu:
Laplacian spectral characterization of some graphs obtained by product operation. 1591-1595 - Yandong Bai, Binlong Li, Shenggui Zhang:
Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts. 1596-1601 - Jack H. Koolen, Alice Lesser, Vincent Moulton, Taoyang Wu:
Injective optimal realizations of finite metric spaces. 1602-1610 - Benjamin R. Smith, Nicholas J. Cavenagh:
Decomposing complete equipartite graphs into odd square-length cycles: Number of parts even. 1611-1622 - Susan G. Barwick, D. J. Marshall:
Conics and multiple derivation. 1623-1632 - Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka:
Harmonious coloring of trees with large maximum degree. 1633-1637 - Richard C. Brewster, Gena Hahn, Stacey Wynn Lamont, Chester Lipka:
Lexicographic products with high reconstruction numbers. 1638-1645 - Adam Hesterberg:
Extremal functions of excluded tensor products of permutation matrices. 1646-1649 - Arseniy V. Akopyan:
A short proof of the Collapsing Walls Lemma. 1650-1651 - Anthony Bonato, Graeme Kemkes, Pawel Pralat:
Almost all cop-win graphs contain a universal vertex. 1652-1657 - Xiangwen Li, Hong-Jian Lai, Yehong Shao:
Degree condition and Z3-connectivity. 1658-1669 - Maksim Zhukovskii:
Zero-one k-law. 1670-1688 - Tomás Kaiser:
A short proof of the tree-packing theorem. 1689-1691 - Lisa Berger, Moshe Dror, James Lynch:
Universal number partition problem with divisibility. 1692-1698 - Andrew M. Baxter, Lara Pudwell:
Enumeration schemes for vincular patterns. 1699-1712 - Jens Schreyer, Erika Skrabul'áková:
On the facial Thue choice index of plane graphs. 1713-1721 - Lali Barrière, Clemens Huemer:
4-labelings and grid embeddings of plane quadrangulations. 1722-1731 - Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
Biased orientation games. 1732-1742 - Youssef Boudabbous, Christian Delhommé:
Prechains and self duality. 1743-1765 - Lee-Ad Gottlieb, Aryeh Kontorovich, Elchanan Mossel:
VC bounds on the cardinality of nearly orthogonal function classes. 1766-1775 - Tanya Khovanova, Sergei Konyagin:
Sequences of integers with missing quotients and dense points without neighbors. 1776-1787 - Piotr Micek, Bartosz Walczak:
Parity in graph sharing games. 1788-1795 - Frédéric Maffray, Ana Silva:
b-colouring outerplanar graphs with large girth. 1796-1803 - Deborah E. Seacrest, Tyler Seacrest:
Grabbing the gold. 1804-1806 - Andrzej Dudek, John R. Schmitt:
On the size and structure of graphs with a constant number of 1-factors. 1807-1811 - Daniel Reichman:
New bounds for contagious sets. 1812-1814 - Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil:
Segment representation of a subclass of co-planar graphs. 1815-1818 - Stephan G. Wagner, Marcel Wild:
Decomposing the hypercube Qn into n isomorphic edge-disjoint trees. 1819-1822 - Ararat Harutyunyan, Bojan Mohar:
Two results on the digraph chromatic number. 1823-1826 - Sho Suda:
A generalization of the Erdős-Ko-Rado theorem to t-designs in certain semilattices. 1827-1831 - Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau:
Locally identifying colourings for graphs with given maximum degree. 1832-1837 - Bernard Ries, Dominique de Werra, Rico Zenklusen:
A note on chromatic properties of threshold graphs. 1838-1843 - Daniel Pragel:
Determinants of box products of paths. 1844-1847
Volume 312, Number 11, June 2012
- Huiqiu Lin, Weihua Yang, Hailiang Zhang, Jinlong Shu:
Distance spectral radius of digraphs with given connectivity. 1849-1856 - Shuya Chiba, Jun Fujisawa, Masao Tsugaki, Tomoki Yamashita:
Long cycles in unbalanced bipartite graphs. 1857-1862 - Tibor Bisztriczky, Jim Lawrence:
Combinatorial types of bicyclic polytopes. 1863-1876 - Ye Chen, Suohai Fan, Hong-Jian Lai:
On 3-connected hamiltonian line graphs. 1877-1882 - Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
A classification of all arc-locally semicomplete digraphs. 1883-1891 - Pak Ching Li, G. H. John van Rees, Stela Hanbyeol Seo, N. M. Singhi:
Friendship 3-hypergraphs. 1892-1899 - Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Independent sets and matchings in subcubic graphs. 1900-1910 - Mark N. Ellingham, Justin Z. Schroeder:
Nonorientable hamilton cycle embeddings of complete tripartite graphs. 1911-1917 - William Y. C. Chen, Carol J. Wang:
Noncrossing linked partitions and large (3, 2)-Motzkin paths. 1918-1922 - Huijuan Wang, Jian-Liang Wu:
A note on the total coloring of planar graphs without adjacent 4-cycles. 1923-1926
Volume 312, Numbers 12-13, July 2012
- Nicolas Lichiardopol:
Vertex-disjoint cycles in regular tournaments. 1927-1930 - Chin-Mei Fu, Nan-Hua Jhuang, Yuan-Lung Lin, H.-M. Sung:
On the existence of k-sun systems. 1931-1939 - Jin-Xin Zhou, Yan-Tao Li:
Cubic non-normal Cayley graphs of order 4p2. 1940-1946 - Mark Bilinski, Kwang Ju Choi, Deborah Chun, Guoli Ding, Stan Dziobiak, Rodrigo Farnham, Perry Iverson, Shirley Leu, Lisa Warshauer Lowrance:
Bandwidth of trees of diameter at most 4. 1947-1951 - Cai Heng Li, Zhe Liu, Zai Ping Lu:
The edge-transitive tetravalent Cayley graphs of square-free order. 1952-1967 - Zhaoping Meng, Jian Wang, Beiliang Du:
(1, 2)-resolvable candelabra quadruple systems and Steiner quadruple systems. 1968-1978 - Nigel Martin:
Path-factorizations of complete bipartite multigraphs. 1979-1984 - Nabil Shalaby, Daniela Silvesan:
The intersection spectrum of Skolem sequences and its applications to λ-fold cyclic triple systems. 1985-1999 - Stanislav Jendrol', Tomás Kaiser, Zdenek Ryjácek, Ingo Schiermeyer:
A Dirac theorem for trestles. 2000-2004 - Mikio Kano, Akira Saito:
Star-factors with large components. 2005-2008 - Yen Duong, Joel Foisy, Killian Meehan, Leanne Merrill, Lynea Snyder:
Intrinsically linked signed graphs in projective space. 2009-2022 - Roman Glebov:
Bijective mapping preserving intersecting antichains for k-valued cubes. 2023-2026 - Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo:
On coloring problems with local constraints. 2027-2039 - Gi-Sang Cheon, Hana Kim, Louis W. Shapiro:
Combinatorics of Riordan arrays with identical A and Z sequences. 2040-2049 - John T. Ethier, Gary L. Mullen:
Strong forms of orthogonality for sets of hypercubes. 2050-2061 - Loni Delaplane, Haidong Wu:
Bounding the coefficients of the characteristic polynomials of simple binary matroids. 2062-2068 - Melvyn B. Nathanson:
Thin bases in additive number theory. 2069-2075 - Vinayak Joshi, Anagha Khiste:
On the zero divisor graphs of p m-lattices. 2076-2082 - Péter Sziklai, Marcella Takáts:
An extension of the direction problem. 2083-2087 - Gerard Jennhwa Chang, Hsiang-Chun Hsu:
First-fit chromatic numbers of d-degenerate graphs. 2088-2090
Volume 312, Number 14, July 2012
- Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Preface. 2091 - Marián Klesc, Daniela Kravecová:
The crossing number of P2n C3. 2096-2101 - Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
Vertex coloring without large polychromatic stars. 2102-2108 - Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On (Kq, k) vertex stable graphs with minimum size. 2109-2118 - Noga Alon, Alexandr V. Kostochka:
Dense uniform hypergraphs have high list chromatic number. 2119-2125 - Gerard J. Chang, Nicolas Roussel:
(Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles. 2126-2130 - Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Circuits of length 5 in 2-factors of cubic graphs. 2131-2134 - Atsuhiro Nakamoto, Shoichi Tsuchiya:
On geometrically realizable Möbius triangulations. 2135-2139 - Arnfried Kemnitz, Ingo Schiermeyer:
Improved degree conditions for Hamiltonian properties. 2140-2145 - Mieczyslaw Borowiecki, Ewa Drgas-Burchardt:
Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs. 2146-2152 - Iztok Peterin:
The pre-hull number and lexicographic product. 2153-2157 - Richard H. Schelp:
Some Ramsey-Turán type problems and related questions. 2158-2161 - Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu:
Weighted-1-antimagic graphs of prime power order. 2162-2169 - L'ubomír Török, Imrich Vrt'o:
A special antidilation problem for meshes and Hamming graphs. 2170-2176 - Roman Kuzel, Zdenek Ryjácek, Jakub Teska, Petr Vrána:
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs. 2177-2189 - Hao Li, Wantao Ning, Junqing Cai:
An implicit degree condition for hamiltonian graphs. 2190-2196
Volume 312, Number 15, August 2012
- Luis Verde-Star:
Transformation formulas for complete symmetric polynomials and identities for generalized binomial coefficients and q-Stirling numbers. 2197-2202 - Zejun Huang, Xingzhi Zhan:
Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths. 2203-2213 - Song-Tao Guo, Yan-Quan Feng:
A note on pentavalent s-transitive graphs. 2214-2216 - Michael D. Barrus:
On 2-switches and isomorphism classes. 2217-2222 - Hao Li, Weihua Yang:
A note on collapsible graphs and super-Eulerian graphs. 2223-2227 - Sen-Peng Eu, Tung-Shan Fu, Yeh-Jong Pan, Chien-Tai Ting:
Sign-balance identities of Adin-Roichman type on 321-avoiding alternating permutations. 2228-2237 - Liangchen Li, Xiangwen Li:
Nowhere-zero 3-flows and Z3-connectivity in bipartite graphs. 2238-2251 - Alberto Amato, Mario Gionfriddo, Lorenzo Milazzo:
2-Regular equicolourings for P4-designs. 2252-2261 - Csaba Király, Ferenc Péterfalvi:
Balanced generic circuits without long paths. 2262-2271 - Charles R. Johnson, Aneta Sawikowska:
Minimizing the least eigenvalue of graphs with fixed order and size. 2272-2285 - David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert:
Generalizations of Graham's pebbling conjecture. 2286-2293 - Deying Li, Suohai Fan, Hong-Jian Lai, Senmei Yao:
A dual version of the Brooks group coloring theorem. 2294-2303 - Danjun Huang, Wai Chee Shiu, Weifan Wang:
On the vertex-arboricity of planar graphs without 7-cycles. 2304-2315 - Miklós Maróti, László Zádori:
Reflexive digraphs with near unanimity polymorphisms. 2316-2328 - Mark Anderson, Richard P. Vitray, Jay Yellen:
Irregular colorings of regular graphs. 2329-2336 - Gi-Sang Cheon, Ji-Hwan Jung:
r-Whitney numbers of Dowling lattices. 2337-2348 - Takuro Fukunaga:
Graph orientations with set connectivity requirements. 2349-2355 - Lih-Hsing Hsu, Jimmy J. M. Tan, Eddie Cheng, László Lipták, Cheng-Kuan Lin, Ming Tsai:
Solution to an open problem on 4-ordered Hamiltonian graphs. 2356-2370 - Giorgio Donati, Nicola Durante:
A group theoretic characterization of Buekenhout-Metz unitals in PG(2, q2) containing conics. 2371-2374 - Xiangqian Zhou:
Generating an internally 4-connected binary matroid from another. 2375-2387 - Alexandru I. Tomescu:
A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs. 2388-2391 - Alex Samorodnitsky, Sergey Yekhanin:
A note on the Newton radius. 2392-2393 - Krzysztof Petelczyc, Malgorzata Prazmowska, Krzysztof Prazmowski, Mariusz Zynel:
A note on characterizations of affine and Hall triple systems. 2394-2396 - Shuli Li, Weigen Yan:
Kekulé structures of polyomino chains and the Hosoya index of caterpillar trees. 2397-2400 - Johan Björklund, Cecilia Holmgren:
Counterexamples to a monotonicity conjecture for the threshold pebbling number. 2401-2405
Volume 312, Number 16, August 2012
- Felix Breuer, Aaron Dall, Martina Kubitzke:
Hypergraph coloring complexes. 2407-2420 - Frank De Clerck, Stefaan De Winter, Thomas Maes:
Partial flocks of the quadratic cone yielding Mathon maximal arcs. 2421-2428 - Anja Pruchnewski, Margit Voigt:
Weights of induced subgraphs in K1, r-free graphs. 2429-2432 - Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman:
An upper bound on the P3-Radon number. 2433-2437 - Elizabeth J. Billington, Nicholas J. Cavenagh, Abdollah Khodkar:
Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems. 2438-2445 - Meili Liang, Bolian Liu:
A proof of two conjectures on the Randić index and the average eccentricity. 2446-2449 - Qiuli Li, Heping Zhang:
On the restricted matching extension of graphs on the torus and the Klein bottle. 2450-2456 - Konrad K. Dabrowski, Vadim V. Lozin, Victor Zamaraev:
On factorial properties of chordal bipartite graphs. 2457-2465 - Shuji Kijima, Shin-ichi Tanigawa:
Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits. 2466-2472 - Hyeong-Kwan Ju, Seunghyun Seo:
Enumeration of (0, 1)-matrices avoiding some 2×2 matrices. 2473-2481 - Bridget Eileen Tenner:
A combinatorial proof of symmetry among minimal star factorizations. 2482-2490 - Michael Dorfling:
Some results on decomposable and reducible graph properties. 2491-2497 - Sjur K. Dyrkolbotn, Michal Walicki:
Kernels in digraphs that are not kernel perfect. 2498-2505 - Sven Herrmann, Vincent Moulton:
Trees, tight-spans and point configurations. 2506-2521 - César Hernández-Cruz, Hortensia Galeana-Sánchez:
k-kernels in k-transitive and k-quasi-transitive digraphs. 2522-2530
Volume 312, Number 17, September 2012
- Hao Li, Yannis Manoussakis:
Preface. 2531 - Charles Delorme:
Eigenvalues of complete multipartite graphs. 2532-2535 - Neil Jami, Zoltán Szigeti:
Edge-connectivity of permutation hypergraphs. 2536-2539 - Jonas Hägglund, Klas Markström:
On stable cycles and cycle double covers of graphs with large circumference. 2540-2544 - Ross Churchley, Jing Huang:
List monopolar partitions of claw-free graphs. 2545-2549 - Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza:
Proper connection of graphs. 2550-2560 - Ben Seamone, Brett Stevens:
Spanning trees with specified differences in Cayley graphs. 2561-2565 - Bernardo Llano, Amanda Montejano:
Rainbow-free colorings for x+y=cz in Zp. 2566-2573 - Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang:
Star subdivisions and connected even factors in the square of a graph. 2574-2578 - Arash Ahadi, Saieed Akbari, Ali Dehghan, Maryam Ghanbari:
On the difference between chromatic number and dynamic chromatic number of graphs. 2579-2583 - Guantao Chen, Zhiquan Hu, Hao Li:
Endpoint extendable paths in dense graphs. 2584-2592 - Saieed Akbari, David Cariolaro, Malihehsadat Chavooshi, Maryam Ghanbari, Sanaz Zare:
Some criteria for a graph to be Class 1. 2593-2598 - Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek:
Gray codes with bounded weights. 2599-2611 - Geoffrey Exoo, Robert Jajcay:
Recursive constructions of small regular graphs of given degree and girth. 2612-2619 - Ghodratollah Aalipour, Saieed Akbari, Reza Nikandish, Mohammad Javad Nikmehr, Farzad Shaveisi:
On the coloring of the annihilating-ideal graph of a commutative ring. 2620-2626 - Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee:
On the hardness of recognizing triangular line graphs. 2627-2638 - Etienne Fieux, Jacqueline Lacaze:
Foldings in graphs and relations with simplicial complexes and posets. 2639-2651 - Jean-Luc Fouquet, Henri Thuillier:
On removable edges in 3-connected cubic graphs. 2652-2659 - Timothy R. S. Walsh, Alain Giorgetti, Alexander D. Mednykh:
Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices. 2660-2671 - Gábor Bacsó, Zsolt Tuza:
Distance domination versus iterated domination. 2672-2675 - Klas Markström:
Even cycle decompositions of 4-regular graphs and line graphs. 2676-2681 - Ronald J. Gould, Wenliang Tang, Erling Wei, Cun-Quan Zhang:
The edge spectrum of the saturation number for small paths. 2682-2689 - C. N. Campos, Celina M. H. de Figueiredo, Raphael Machado, Célia Picinin de Mello:
The total chromatic number of split-indifference graphs. 2690-2693 - Raquel Águeda, Valentin Borozan, Yannis Manoussakis, Gervais Mendy, Rahul Muthu:
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs. 2694-2699 - Ralph J. Faudree, Hao Li:
Locating pairs of vertices on Hamiltonian cycles. 2700-2706 - Marwane Bouznif, Julien Moncel, Myriam Preissmann:
Generic algorithms for some decision problems on fasciagraphs and rotagraphs. 2707-2719 - Richard P. Anstee, Miguel Raggi, Attila Sali:
Evidence for a forbidden configuration conjecture: One more case solved. 2720-2729 - Cristina Dalfó, Edwin R. van Dam, Miguel Angel Fiol, Ernest Garriga:
Dual concepts of almost distance-regularity and the spectral excess theorem. 2730-2734 - Július Czap, Stanislav Jendrol', Frantisek Kardos, Roman Soták:
Facial parity edge colouring of plane pseudographs. 2735-2740 - Tom Coker, Karen Johannson:
The adjacent vertex distinguishing total chromatic number. 2741-2750 - Hortensia Galeana-Sánchez:
A new characterization of perfect graphs. 2751-2755
Volume 312, Number 18, September 2012
- Eckhard Steffen:
Nearly nowhere-zero r-flow graphs. 2757-2759 - Theodore Dokos, Tim Dwyer, Bryan P. Johnson, Bruce E. Sagan, Kimberly Selsor:
Permutation patterns and statistics. 2760-2775 - Jia Huang:
An improved upper bound for the bondage number of graphs on surfaces. 2776-2781 - Weifan Wang, Stephen Finbow, Ping Wang:
An improved bound on parity vertex colourings of outerplane graphs. 2782-2787 - Xin Zhang, Guizhen Liu, Jianliang Wu:
Edge covering pseudo-outerplanar graphs with forests. 2788-2799 - Binlong Li, Hajo Broersma, Shenggui Zhang:
Pairs of forbidden induced subgraphs for homogeneously traceable graphs. 2800-2818 - Leonid Plachta, Jakub Przybylo, Mariusz Wozniak:
Seifert graphs and the braid index of classical and singular links. 2819-2831 - Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate:
Families of small regular graphs of girth 5. 2832-2842 - Hedvig Mohácsy:
A large order asymptotic existence theorem for group divisible 3-designs with index one. 2843-2848
Volume 312, Number 19, October 2012
- Lionel Pournin:
Lifting simplicial complexes to the boundary of convex polytopes. 2849-2862 - Imran F. Khan, Mehvish I. Poshni, Jonathan L. Gross:
Genus distribution of P3□Pn. 2863-2871 - Elena Rubei:
On dissimilarity vectors of general weighted trees. 2872-2880 - David J. Galvin:
The independent set sequence of regular bipartite graphs. 2881-2892 - Yannan Li, Yanxun Chang, Bingli Fan:
The intersection numbers of KTSs with a common parallel class. 2893-2904 - Yair Caro, Adriana Hansberg, Michael A. Henning:
Fair domination in graphs. 2905-2914 - Carlos A. Di Prisco, Stevo Todorcevic:
Shift graphs on precompact families of finite sets of natural numbers. 2915-2926 - David Callan, Emeric Deutsch:
The run transform. 2927-2937 - Jeong-Ok Choi, John P. Georges, David W. Mauro:
Relating edge-coverings to the classification of ℤ2k-magic graphs. 2938-2945 - Ping Zhao, Kefeng Diao, Renying Chang, Kaishun Wang:
The smallest one-realization of a given set II. 2946-2951 - Andrzej Dudek, Reshma Ramadurai:
Some remarks on vertex Folkman numbers for hypergraphs. 2952-2957 - Soohak Choi, Hyun Kwang Kim, Dong Yeol Oh:
Structures and lower bounds for binary covering arrays. 2958-2968 - Yingying Qin, Jianping Ou:
Sufficient conditions for maximally restricted edge connected graphs. 2969-2972 - Olof Heden:
A note on the symmetry group of full rank perfect binary codes. 2973-2977
Volume 312, Number 20, October 2012
- Toufik Mansour, Matthias Schork, Mark Shattuck:
Catalan numbers and pattern restricted set partitions. 2979-2991 - Hovhannes A. Harutyunyan, Arthur L. Liestman:
Upper bounds on the broadcast function using minimum dominating sets. 2992-2996 - Chuanan Wei, Qinglun Yan, Jianbo Li:
A short proof for Dougall's 2H2-series identity. 2997-2999 - Dean Crnkovic, Bernardo Gabriel Rodrigues, Sanja Rukavina, Loredana Simcic:
Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs. 3000-3010 - Mohammed Amin Tahraoui, Éric Duchêne, Hamamache Kheddouci:
Gap vertex-distinguishing edge colorings of graphs. 3011-3025 - Sylwia Cichacz, Agnieszka Görlich, Mateusz Nikodem, Andrzej Zak:
A lower bound on the size of (H; 1)-vertex stable graphs. 3026-3029 - Lars-Daniel Öhman:
On the intricacy of avoiding multiple-entry arrays. 3030-3036 - Ma-Lian Chia, Huei-Ni Hsu, David Kuo, Sheng-Chyang Liaw, Zi-teng Xu:
The game L(d, 1)-labeling problem of graphs. 3037-3045 - Michael I. Hartley, Daniel Pellicer, Gordon I. Williams:
Minimal covers of the prisms and antiprisms. 3046-3058 - Yichao Chen, Jonathan L. Gross, Toufik Mansour:
Genus distributions of star-ladders. 3059-3067 - M. Liang:
A natural generalization of orthogonality of Latin squares. 3068-3075
Volume 312, Number 21, November 2012
- Kejun Chen, Wen Li:
Existence of normal bimagic squares. 3077-3086 - Hengzhe Li, Weihua Yang, Jixiang Meng:
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees. 3087-3095 - Ryan R. Martin, Jason J. Smith:
Induced saturation number. 3096-3106 - Michael A. Henning, Christian Löwenstein:
Locating-total domination in claw-free cubic graphs. 3107-3116 - Jianming Zhu:
Two new edge grafting operations on the energy of unicyclic graphs and their applications. 3117-3127 - Yuemei Huang, Yanxun Chang:
The sizes of optimal (n, 4, λ, 3) optical orthogonal codes. 3128-3139 - Runli Tian, Liming Xiong, Zhaohong Niu:
On 2-factors in claw-free graphs whose edges are in small cycles. 3140-3145 - Mohammed Amin Abdullah, Colin Cooper, Alan M. Frieze:
Cover time of a random graph with given degree sequence. 3146-3163 - Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno:
Subgraph isomorphism in graph classes. 3164-3173 - Yongsheng Ye, Mingqing Zhai, Yun Zhang:
Pebbling number of squares of odd cycles. 3174-3178 - Markus Kuba, Alois Panholzer:
Enumeration formulæ for pattern restricted Stirling permutations. 3179-3194 - Mark S. MacLean:
A new approach to the Bipartite Fundamental Bound. 3195-3202 - Yongsheng Ye, Pengfei Zhang, Yun Zhang:
The pebbling number of squares of even cycles. 3203-3211
Volume 312, Number 22, November 2012
- Matthias Böhm, Karsten Schölzel:
A generalization of Completely Separating Systems. 3213-3227 - Erik E. Westlund:
Hamilton decompositions of certain 6-regular Cayley graphs on Abelian groups with a cyclic subgroup of index two. 3228-3235 - Sergio Bermudo, Henning Fernau:
Lower bounds on the differential of a graph. 3236-3250 - Nasrin Soltankhah, Somaye Ahmadi:
The intersection problem for 2-(v, 5, 1) directed block designs. 3251-3264 - Suzanne M. Seager:
Locating a robber on a graph. 3265-3269 - Shixin Zhu, Kaiyan Qian, Xiaoshan Kai:
A note on negacyclic self-dual codes over Z2a. 3270-3275 - Xianyong Meng, Jianhua Guo, Bentang Su:
Incidence coloring of pseudo-Halin graphs. 3276-3282 - Eiichi Bannai, Takahiro Sato, Junichi Shigezumi:
Maximal m-distance sets containing the representation of the Johnson graph J(n, m). 3283-3292 - Morten Hegner Nielsen, Ortrud R. Oellermann:
Separation properties of 3-Steiner and 3-monophonic convexity in graphs. 3293-3305 - Ramón Béjar, Cèsar Fernández, Carles Mateu, Magda Valls:
The Sudoku completion problem with rectangular hole pattern is NP-complete. 3306-3315 - Anuradha Sharma, Amit K. Sharma:
On MacWilliams type identities for r-fold joint m-spotty weight enumerators. 3316-3327 - Atif A. Abueida, C. A. Rodger:
Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions suffice. 3328-3334 - Oleg V. Borodin, Anna O. Ivanova:
Acyclic 4-choosability of planar graphs without adjacent short cycles. 3335-3341 - Zhihe Liang:
Cycle-supermagic decompositions of complete multipartite graphs. 3342-3348 - Mohsen Jannesari, Behnaz Omoomi:
The metric dimension of the lexicographic product of graphs. 3349-3356 - Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Mixed unit interval graphs. 3357-3363 - Nathan Keller, Elchanan Mossel, Tomer Schlank:
A note on the Entropy/Influence conjecture. 3364-3372 - Ayesha Riasat, Uwe Schauz:
Critically paintable, choosable or colorable graphs. 3373-3383 - David M. Howard, Clifford D. Smyth:
Revolutionaries and Spies. 3384-3391 - Meixin Niu, Haitao Cao:
More results on cycle frames and almost resolvable cycle systems. 3392-3405 - Robert Molina, Myles F. McNally:
Randomly Pk-decomposable graphs. 3406-3416 - Reza Akhtar:
The representation number of some sparse graphs. 3417-3423
Volume 312, Number 23, December 2012
- Jaroslaw Grytczuk, Zbigniew Lonc:
Preface. 3425 - Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek:
On-line version of Rabinovitch theorem for proper intervals. 3426-3436 - Mieczyslaw Borowiecki, Anna Fiedorowicz:
Q-Ramsey classes of graphs. 3437-3443 - Konstanty Junosza-Szaniawski, Pawel Rzazewski:
On the number of 2-packings in a connected graph. 3444-3450 - Katarzyna Jesse-Józefczyk:
Monotonicity and expansion of global secure sets. 3451-3456 - Michal Debski:
Perfect matchings in antipodally colored lattice of subsets. 3457-3460 - Marcin Anholcer, Cory Palmer:
Irregular labelings of circulant graphs. 3461-3466 - Andrzej Grzesik:
Indicated coloring of graphs. 3467-3472
Volume 312, Number 24, December 2012
- Behrooz Bagheri Gh., Diane M. Donovan, Ebadollah S. Mahmoodian:
On the existence of 3-way k-homogeneous Latin trades. 3473-3481 - Johannes H. Hattingh, Nader Jafari Rad, Sayyed Heidar Jafari, Marc Loizeaux, John Matthews, Lucas C. van der Merwe:
Total edge critical graphs with leaves. 3482-3488 - Jean-Yves Enjalbert, Vincel Hoang Ngoc Minh:
Combinatorial study of colored Hurwitz polyzêtas. 3489-3497 - Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Maximum order of trees and bipartite graphs with a given rank. 3498-3501 - Linyuan Lu, Xing Peng:
The fractional chromatic number of triangle-free graphs with Δ<3. 3502-3516 - Alexandr V. Kostochka, Noah Prince:
On Ks, t-minors in graphs with given average degree, II. 3517-3522 - Gábor Czédli, László Ozsvárt, Balázs Udvari:
How many ways can two composition series intersect? 3523-3536 - Anders Sune Pedersen:
Hadwiger's Conjecture and inflations of the Petersen graph. 3537-3543 - Danjun Huang, Weifan Wang, Chengchao Yan:
A note on the adjacent vertex distinguishing total chromatic number of graphs. 3544-3546 - Stefan Gyürki:
Constructing goal-minimally k-diametric graphs by lifts. 3547-3552 - Herwig Hauser, Christoph Koutschan:
Multivariate linear recurrences and power series division. 3553-3560 - Yingqian Wang, Ping Sheng:
Acyclic edge coloring of sparse graphs. 3561-3573 - Zhaoping Meng, Beiliang Du:
The last twenty orders of (1, 2)-resolvable Steiner quadruple systems. 3574-3584 - Frank E. Bennett, Hantao Zhang:
Quasigroups satisfying Stein's third law with a specified number of idempotents. 3585-3605 - Agnieszka Görlich, Andrzej Zak:
Sparse graphs of girth at least five are packable. 3606-3613 - Ebrahim Ghaderpour, Dave Witte Morris:
Cayley graphs of order 30p are Hamiltonian. 3614-3625 - Hossein Hajiabolhassan, Farokhlagha Moazami:
Some new bounds for cover-free families through biclique covers. 3626-3635 - Patrick Ali, Peter Dankelmann, Simon Mukwembi:
The radius of k-connected planar graphs with bounded faces. 3636-3642 - Katja Bercic, Mohsen Ghasemi:
Tetravalent arc-transitive graphs of order twice a product of two primes. 3643-3648 - Ping Sun:
Proof of two conjectures of Petkovšek and Wilf on Gessel walks. 3649-3655 - Alexey A. Glazyrin:
Lower bounds for the simplexity of the n-cube. 3656-3662 - Huiqiu Lin, Jinlong Shu, Yarong Wu, Guanglong Yu:
Spectral radius of strongly connected digraphs. 3663-3669 - Hao Li, Weihua Yang:
Every 3-connected essentially 10-connected line graph is Hamilton-connected. 3670-3674
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 2026-01-15 01:28 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:
