Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 310
Volume 310, Number 1, January 2010
- Xinrong Ma:
Magic determinants of Somos sequences and theta functions. 1-5
- Yusuke Suzuki:
Optimal 1-planar graphs which triangulate other surfaces. 6-11 - Xiaoshan Kai, Shixin Zhu:
On the distances of cyclic codes of length 2e over Z4. 12-20 - Dániel Gerbner
, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Polychromatic colorings of arbitrary rectangular partitions. 21-30 - C. Anderson, Jonathan Cutler, A. J. Radcliffe, Lorenzo Traldi:
On the interlace polynomials of forests. 31-36 - Martin Knor, Sanming Zhou:
Diameter and connectivity of 3-arc graphs. 37-42 - Olof Heden, Martin Hessler, Thomas Westerbäck:
On the classification of perfect codes: Extended side class structures. 43-55 - John P. McSorley, John A. Trono:
On k-minimum and m-minimum edge-magic injections of graphs. 56-69 - Wei Wang, Cheng-Xian Xu:
On the asymptotic behavior of graphs determined by their generalized spectra. 70-76 - Márton Naszódi, Steven Taschuk:
On the transversal number and VC-dimension of families of positive homothets of a convex body. 77-82 - Xiaojing Chen, Wenchang Chu:
Dixon's 3F2(1)-series and identities involving harmonic numbers and the Riemann zeta function. 83-91 - Jeremy Aikin, Carolyn Chun, Rhiannon Hall, Dillon Mayhew:
Internally 4-connected binary matroids with cyclically sequential orderings. 92-108 - Mira-Cristiana Anisiu, Valeriu Anisiu, Zoltán Kása:
Total palindrome complexity of finite words. 109-114 - Joshua Brown Kramer:
Fractional set systems with few disjoint pairs. 115-124 - Vladimir Nikiforov:
Turán's theorem inverted. 125-131 - Bernard Ries, Cédric Bentz, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Rico Zenklusen:
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. 132-146 - Yingqian Wang, Huajing Lu, Ming Chen:
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. 147-158 - Shimin Yu, Fang-Ming Shao, Huajun Meng:
Uniformly optimal graphs in some classes of graphs with node failures. 159-166 - Oleg V. Borodin, Mickaël Montassier, André Raspaud:
Planar graphs without adjacent cycles of length at most seven are 3-colorable. 167-173 - Iain Moffatt:
Partial duality and Bollobás and Riordan's ribbon graph polynomial. 174-183 - Stasys Jukna:
Representing (0, 1)-matrices by boolean circuits. 184-187 - Meysam Alishahi, Hossein Hajiabolhassan, Ali Taherkhani:
A generalization of the Erdös-Ko-Rado theorem. 188-191 - Jana Tomanová:
A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions. 192-195
Volume 310, Number 2, January 2010
- Keith J. Edwards, Terry S. Griggs, Jan van den Heuvel, Stephanie Perkins, Bridget S. Webb, Vadim E. Zverovich:
Preface. 197-198 - Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz:
Edge colouring by total labellings. 199-205 - Jason D. Rudd:
Tutte polynomials for counting and classifying orbits. 206-222 - Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou:
Acyclic improper colourings of graphs with bounded maximum degree. 223-229 - Peter J. Cameron, Thomas Prellberg, Dudley Stark:
Asymptotic enumeration of 2-covers and line graphs. 230-240 - Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. 241-254 - Nawel Kahoul, Abdelhafid Berrachedi:
Cycle-regular graphs of (0, lambda)-graph type. 255-259 - Lyes Dekar, Brice Effantin, Hamamache Kheddouci:
[r, s, t]-coloring of trees and bipartite graphs. 260-269 - Bill Jackson, Tibor Jordán:
Brick partitions of graphs. 270-275 - David Cariolaro, Hung-Lin Fu:
Covering graphs with matchings of fixed size. 276-287 - Anthony J. W. Hilton:
Degree-bounded factorizations of bipartite multigraphs and of pseudographs. 288-302 - John Arhin:
Every SOMA(n-2, n) is Trojan. 303-311 - Ian Anderson, Donald A. Preece:
Combinatorially fruitful properties of 3.2-1 and 3.2-2 modulo p. 312-324 - Michael B. Smyth, Rueiher Tsaur, Iain Stewart:
Topological graph dimension. 325-329 - J. Keith Dugdale, Stanley Fiorini, Anthony J. W. Hilton, John Baptist Gauci:
Continuous k-to-1 functions between complete graphs of even order. 330-346 - Peter J. Cameron:
Research Problems from the BCC21. 347-354 - Bert Randerath, Preben D. Vestergaard:
All P3-equipackable graphs. 355-359 - Adam R. Philpotts, Robert J. Waters:
Solution to a problem of Nicolas Lichiardopol. 360-363 - Alewyn P. Burger, Christina M. Mynhardt:
Regular graphs are not universal fixers. 364-368
Volume 310, Number 3, February 2010
- Jan Kratochvíl, Jaroslav Nesetril, Zdenek Ryjácek:
Preface. 371-372 - Anthony Bonato, Dejan Delic, Igor Dolinka:
All countable monoids embed into the monoid of the infinite random graph. 373-375 - Václav Koubek, Vojtech Rödl:
On the number of graphs with a given endomorphism monoid. 376-384 - Eckhard Steffen:
Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. 385-389 - Daniel Berend, Ephraim Korach, Shira Zucker:
Anticoloring and separation of graphs. 390-399 - Stanislav Jendrol', Jozef Miskuf, Roman Soták:
Total edge irregularity strength of complete graphs and complete bipartite graphs. 400-407 - Peter J. Cameron, Taoyang Wu:
The complexity of the weight problem for permutation and matrix groups. 408-416 - Róbert Hajduk, Roman Soták:
On large light graphs in families of polyhedral graphs. 417-422 - P. V. Skums, S. V. Suzdal, R. I. Tyshkevich:
Operator decomposition of graphs and the reconstruction conjecture. 423-429 - Isidoro Gitler, Enrique Reyes, Rafael H. Villarreal:
Ring graphs and complete intersection toric ideals. 430-441 - Mirko Hornák, Jana Zlámalová:
Another step towards proving a conjecture by Plummer and Toft. 442-452 - Norihide Tokushige:
A multiply intersecting Erdos-Ko-Rado theorem - The principal case. 453-460 - Zsolt Tuza:
Hall number for list colorings of graphs: Extremal results. 461-470 - Shalom Eliahou, Michel Kervaire:
Minimal sumsets in finite solvable groups. 471-479 - Anders Sune Pedersen, Bjarne Toft:
A basic elementary extension of the Duchet-Meyniel theorem. 480-488 - Gabriela Araujo-Pardo, Mika Olsen:
A conjecture of Neumann-Lara on infinite families of r-dichromatic circulant tournaments. 489-492 - Arnaud Pêcher, Annegret Katrin Wagler:
On facets of stable set polytopes of claw-free graphs with stability number 3. 493-498 - Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers:
Note on robust critical graphs with large odd girth. 499-504 - L'ubomír Török, Imrich Vrt'o:
Antibandwidth of three-dimensional meshes. 505-510 - Miguel Angel Fiol, Margarida Mitjana:
The local spectra of regular line graphs. 511-517 - Alexander D. Mednykh, Roman Nedela:
Enumeration of unrooted hypermaps of a given genus. 518-526 - Ladislav Nebesky:
Distance-hereditary graphs and signpost systems. 527-530 - Josep Díaz, Marcin Kaminski, Dimitrios M. Thilikos:
A note on the subgraphs of the (2×∞)-grid. 531-536 - Dalibor Froncek, Petr Kovár, Tereza Kovárová, Michael Kubesa:
Factorizations of complete graphs into caterpillars of diameter 5. 537-556 - Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni:
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. 557-560 - Robert Berke, Dieter Mitsche:
Colorings at minimum cost. 561-569 - Zdenek Ryjácek, Zdzislaw Skupien, Petr Vrána:
On cycle lengths in claw-free graphs with complete closure. 570-574 - Vsevolod F. Lev:
Sums and differences along Hamiltonian cycles. 575-584 - Alain Doyon, Gena Hahn, André Raspaud:
Some bounds on the injective chromatic number of graphs. 585-590 - Peter J. Cameron, Mihyun Kang, Dudley Stark:
Random preorders and alignments. 591-603 - Peter J. Cameron, Deborah C. Lockett:
Posets, homomorphisms and homogeneity. 604-613 - Andrew D. King, Gary MacGillivray:
The firefighter problem for cubic graphs. 614-621 - Steve Butler, Jia Mao, Ronald L. Graham:
How to play the Majority game with a liar. 622-629 - Ian Levitt, Gábor N. Sárközy, Endre Szemerédi:
How to avoid using the Regularity Lemma: Pósa's conjecture revisited. 630-641 - Zdenek Dvorák, Daniel Král', Jakub Teska:
Toughness threshold for the existence of 2-walks in K4-minor-free graphs. 642-651 - Frantisek Kardos:
Fulleroids with dihedral symmetry. 652-661 - Stephan Brandt:
Triangle-free graphs whose independence number equals the degree. 662-669
Volume 310, Number 4, February 2010
- Shonda Gosselin:
Vertex-transitive self-complementary uniform hypergraphs of prime order. 671-680 - Agnieszka Görlich, Monika Pilsniak:
A note on an embedding problem in transitive tournaments. 681-686 - Daniel Gross, Nathan Kahl, John T. Saccoman:
Graphs with the maximum or minimum number of 1-factors. 687-691 - Diane M. Donovan, Ales Drápal, Mike J. Grannell, Terry S. Griggs, James G. Lefevre:
Quarter-regular biembeddings of Latin squares. 692-699 - Zi Hong Tian, Ruizhong Wei:
Decomposing triples into cyclic designs. 700-713 - Jun Guo, Kaishun Wang:
Posets associated with subspaces in a d-bounded distance-regular graph. 714-719 - Jiuqiang Liu, Xiaodong Liu:
Cross L-intersecting families on set systems. 720-726 - Aidan Roy:
Minimal Euclidean representations of graphs. 727-733 - Van Bang Le, Nguyen Ngoc Tuy:
The square of a block graph. 734-741 - Yair Caro, Raphael Yuster:
Large induced subgraphs with equated maximum degree. 742-747 - Yuuki Tanaka, Yosuke Kikuchi, Toru Araki, Yukio Shibata:
Bipancyclic properties of Cayley graphs generated by transpositions. 748-754 - Bart De Bruyn, Pieter Vandecasteele:
The valuations of the near octagon G4. 755-766 - Mirko Lepovic:
Some new results on walk regular graphs which are cospectral to its complement. 767-773 - Domingos Dellamonica Jr., Colton Magnant, Daniel M. Martin:
Rainbow paths. 774-781 - Hirobumi Mizuno, Iwao Sato:
Scattering matrices of regular coverings of graphs. 782-791 - Mordecai J. Golin, Xuerong Yong, Yuanping Zhang:
The asymptotic number of spanning trees in circulant graphs. 792-803 - Bahman Khosravi, Mojgan Mahmoudi:
On Cayley graphs of rectangular groups. 804-811 - Ligong Wang, Qi Wang:
Integral complete multipartite graphs Ka1.p1, a2.p2, ..., as.ps with s=5, 6. 812-818 - Koji Nuida:
A characterization of signed graphs with generalized perfect elimination orderings. 819-831 - Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Some remarks on the geodetic number of a graph. 832-837 - Anna S. Lladó, Susana-Clara López, Jordi Moragas:
Every tree is a large subtree of a tree that decomposes Kn or Kn, n. 838-842 - Amitabha Tripathi, Sushmita Venugopalan, Douglas B. West:
A short constructive proof of the Erdos-Gallai characterization of graphic lists. 843-844 - Jean Daligault, Daniel Gonçalves, Michaël Rao:
Diamond-free circle graphs are Helly circle. 845-849 - Dirk Meierling, Lutz Volkmann:
Cycle factors in strongly connected local tournaments. 850-860 - Byungchan Kim:
On inequalities and linear relations for 7-core partitions. 861-868 - Brendon Rhoades:
Hall-Littlewood polynomials and fixed point enumeration. 869-876 - Fu-Tao Hu, Jian-Wei Wang, Jun-Ming Xu:
A new class of transitive graphs. 877-886 - Lidong Wang, Renwang Su:
On the existence of maximum resolvable (K4-e)-packings. 887-896 - Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner:
Rooted directed path graphs are leaf powers. 897-910 - Steve Kirkland:
Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality. 911-921 - Péter Hajnal, Gábor V. Nagy:
Simply sequentially additive labelings of 2-regular graphs. 922-928 - Lan Lei, Xiao-Min Li, Bin Wang, Hong-Jian Lai:
On (s, t)-supereulerian graphs in locally highly connected graphs. 929-934 - Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
A new upper bound on the queuenumber of hypercubes. 935-939 - Simon Mukwembi:
On diameter and inverse degree of a graph. 940-946 - Mingqing Zhai, Ruifang Liu, Jinlong Shu:
Minimizing the least eigenvalue of unicyclic graphs with fixed diameter. 947-955 - Adrian Dumitrescu, Minghui Jiang:
Monochromatic simplices of any volume. 956-960 - Alexander E. Patkowski:
A note on the rank parity function. 961-965 - Rudi Penne:
A note on certain de Bruijn sequences with forbidden subsequences. 966-969 - Horst Trinker:
New explicit bounds for ordered codes and (t, m, s)-nets. 970-975
Volume 310, Number 5, March 2010
- András Gyárfás, Gábor N. Sárközy:
Gallai colorings of non-complete graphs. 977-980 - Jun Yuan, Aixia Liu:
Sufficient conditions for lambdak-optimality in triangle-free graphs. 981-987 - Jongsung Kim, Seokhie Hong, Jongin Lim:
Impossible differential cryptanalysis using matrix method. 988-1002 - Dalibor Froncek, Petr Kovár, Michael Kubesa:
Decompositions of complete graphs into blown-up cycles Cm[2]. 1003-1015 - Graham R. Brightwell, Viresh Patel:
Average relational distance in linear extensions of posets. 1016-1021 - David M. Howard, Randy Shull, Noah Streib, Ann N. Trenk:
The total linear discrepancy of an ordered set. 1022-1025 - Shang-wang Tan:
On the Laplacian spectral radius of weighted trees with a positive weight set. 1026-1036 - Ganesh Dutta, Premadhis Das, Nripes K. Mandal:
Optimum covariate designs in a binary proper equi-replicate block design set-up. 1037-1049 - Xiangjuan Yao, Xiangwen Li, Hong-Jian Lai:
Degree conditions for group connectivity. 1050-1058 - Jenq-Jong Lin:
Decomposition of balanced complete bipartite multigraphs into multistars. 1059-1065