default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 307
Volume 307, Number 1, January 2007
- Grzegorz Binczak, Anna B. Romanowska, Jonathan D. H. Smith:
Poset extensions, convex sets, and semilattice presentations. 1-11 - Ernest J. Cockayne:
Irredundance, secure domination and maximum degree in trees. 12-17 - D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. John van Rees, Ruizhong Wei:
Constructions and bounds for (m, t)-splitting systems. 18-37 - Jun Fujisawa
:
Heavy fans, cycles and paths in weighted graphs of large connectivity. 38-53 - Anka Golemac, Josko Mandic, Tanja Vucicic:
On the existence of difference sets in groups of order 96. 54-68 - Gerzson Kéri, Patric R. J. Östergård:
Further results on the covering radius of small codes. 69-77 - Zhaoxiang Li, Yanpei Liu:
Chromatic sums of general maps on the sphere and the projective plane. 78-87 - Ortrud R. Oellermann, María Luz Puertas:
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. 88-96 - Maurice Pouzet, Imed Zaguia:
Weak orders admitting a perpendicular linear order. 97-107
- Nawarat Ananchuen, Lou Caccetta, Watcharaphong Ananchuen:
A characterization of maximal non-k-factor-critical graphs. 108-114 - Ivan Chajda:
Orthomodular semilattices. 115-118 - Shao-Fei Du, Jin Ho Kwak, Roman Nedela:
Classification of regular embeddings of hypercubes of odd dimension. 119-124 - Haicheng Ma, Haizhen Ren:
The new methods for constructing matching-equivalence graphs. 125-131 - Aidan Roy, Gordon F. Royle:
The chromatic number and rank of the complements of the Kasami graphs. 132-136 - Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Qiao Jing:
The planar Ramsey number PR(K4-e, K5). 137-142
Volume 307, Number 2, January 2007
- Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
Connectivity of graphs with given girth pair. 155-162 - Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin:
Nonrepetitive colorings of trees. 163-172 - Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah:
On defining numbers of circular complete graphs. 173-180 - Zdenek Dvorák, Riste Skrekovski, Tomás Valla:
Four gravity results. 181-190 - Jonathan David Farley:
A structure theorem for posets admitting a "strong" chain partition: : A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities). 191-198 - Arnfried Kemnitz, Massimiliano Marangio:
[r, s, t]-Colorings of graphs. 199-207 - Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen:
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs. 208-215 - José G. Mijares:
Parametrizing the abstract Ellentuck theorem. 216-225 - William P. Orrick, Bruce Solomon:
Large-determinant sign matrices of order 4k+1. 226-236 - Iwao Sato:
Zeta functions and complexities of a semiregular bipartite graph and its line graph. 237-245 - Yingshan Zhang:
Orthogonal arrays obtained by repeating-column difference matrices. 246-261
- Mustapha Aouchiche, Pierre Hansen:
On a conjecture about the Randic index. 262-265 - L. Sunil Chandran, Naveen Sivadasan:
On the Hadwiger's conjecture for graph products. 266-273 - Masahiro Hachimori, Kenji Kashiwabara:
On the topology of the free complexes of convex geometries. 274-279 - Shengbiao Hu:
The largest eigenvalue of unicyclic graphs. 280-284 - Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
On the spanning connectivity of graphs. 285-289 - Lingsheng Shi:
The tail is cut for Ramsey numbers of cubes. 290-292 - Zhao Zhang, Jinjiang Yuan:
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. 293-298
Volume 307, Numbers 3-5, February 2007
- Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski:
Preface. 299 - Janez Ales, Bojan Mohar, Tomaz Pisanski:
Heuristic search for Hamilton cycles in cubic graphs. 303-309 - Vladimir Batagelj, Matjaz Zaversnik:
Short cycle connectivity. 310-318 - Halina Bielak:
Ramsey and 2-local Ramsey numbers for disjoint unions of cycles. 319-330 - Marko Boben:
Irreducible (v3) configurations and graphs. 331-344 - Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
On cube-free median graphs. 345-351 - Jason I. Brown, Richard J. Nowakowski:
The well-covered dimension of random graphs. 352-355 - Irène Charon, Olivier Hudry, Antoine Lobstein:
Extremal cardinalities for identifying and locating-dominating codes in graphs. 356-366 - Marston D. E. Conder, Steve Wilson:
Inner reflectors and non-orientable regular maps. 367-372 - Edward Dobson, Aleksander Malnic, Dragan Marusic, Lewis A. Nowitz:
Minimal normal subgroups of transitive permutation groups of square-free degree. 373-385 - Tomás Feder, Pavol Hell, Jing Huang:
List homomorphisms of graphs with bounded degrees. 386-392 - Tomás Feder, Pavol Hell, Jing Huang:
The structure of bi-arc trees. 393-401 - Gasper Fijavz:
Hadwiger's conjecture for circular colorings of edge-weighted graphs. 402-408 - Aleksander Malnic, Dragan Marusic, Primoz Sparl, Bostjan Frelih:
Symmetry structure of bicirculants. 409-414 - Michael Giudici, Cai Heng Li, Primoz Potocnik, Cheryl E. Praeger:
Homogeneous factorisations of complete multipartite graphs. 415-431 - Sylvain Gravier, Julien Moncel:
On graphs having a V\{x} set as an identifying code. 432-434 - Sylvain Gravier, Julien Moncel, Charles Payan:
A generalization of the pentomino exclusion problem: Dislocation of graphs. 435-444 - Branko Grünbaum:
Graphs of polyhedra; polyhedra as graphs. 445-463 - Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert:
Fast recognition of classes of almost-median graphs. 464-471 - Wilfried Imrich, Iztok Peterin:
Recognizing Cartesian products in linear time. 472-483 - Robert Jajcay, Aleksander Malnic, Dragan Marusic:
On the number of closed walks in vertex-transitive graphs. 484-493 - Matthias Kriesell:
How to contract an essentially 6-connected graph to a 5-connected graph. 494-510 - Young Soo Kwon, Roman Nedela:
Non-existence of nonorientable regular embeddings of n-dimensional cubes. 511-516 - Lubica Liskova, Martin Macaj, Martin Skoviera:
Regular maps from Cayley graphs III: t-balanced Cayley maps. 517-533 - Marko Lovrecic Sarazin, Walter Pacco, Andrea Previtali:
Generalizing the generalized Petersen graphs. 534-543 - Stefko Miklavic:
On bipartite Q-polynomial distance-regular graphs with c2=1. 544-553 - David Orden, Francisco Santos, Brigitte Servatius, Herman Servatius:
Combinatorial pseudo-triangulations. 554-566 - Tomaz Pisanski:
A classification of cubic bicirculants. 567-578 - Primoz Potocnik, Mateja Sajna, Gabriel Verret:
Mobility of vertex-transitive graphs. 579-591 - Marko Razpet:
The middle row of the principal cell. 592-598 - Jana Siagiová, Mark E. Watkins:
Covalence sequences of planar vertex-homogeneous maps. 599-614 - Douglas M. Van Wieren:
Critical cyclic patterns related to the domination number of the torus. 615-632 - Arjana Zitnik:
Series parallel extensions of plane graphs to dual-eulerian graphs. 633-640 - Blaz Zmazek, Janez Zerovnik:
Weak reconstruction of strong product graphs. 641-649 - Bojan Mohar, Richard J. Nowakowski, Douglas B. West:
Research problems from the 5th Slovenian Conference (Bled, 2003). 650-658
Volume 307, Number 6, March 2007
- Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
On the restricted connectivity and superconnectivity in graphs with given girth. 659-667 - Jason Bell, Mark A. Skandera:
Multicomplexes and polynomials with real zeros. 668-682 - Tamara Burton, David P. Sumner:
gamma-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalent. 683-693 - Yair Caro, Dieter Rautenbach:
Reconstructing graphs from size and degree properties of their induced k-subgraphs. 694-703 - Maria Rita Casali:
Estimating Matveev's complexity via crystallization theory. 704-714 - H. Michael Damm:
Totally anti-symmetric quasigroups for all orders n =/ 2, 6. 715-729 - Mirko Lepovic:
On conjugate adjacency matrices of a graph. 730-738 - Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
Complete arcs in PG(2, 25): The spectrum of the sizes and the classification of the smallest complete arcs. 739-747
- Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Counterexample to a conjecture of Györi on C2l-free bipartite graphs. 748-749 - Dragic Bankovic:
Boolean inequations. 750-755 - Frank Gurski, Egon Wanke:
A local characterization of bounded clique-width for line graphs. 756-759 - Yi Ru Huang, Yuandi Wang, Wancheng Sheng, Jian Sheng Yang, Kemin Zhang, Jian Huang:
New upper bound formulas with parameters for Ramsey numbers. 760-763 - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto:
The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces. 764-768 - Michel Morvan, Eric Rémila, Eric Thierry:
A note on the structure of spaces of domino tilings. 769-773 - Vladimir Nikiforov:
Eigenvalue problems of Nordhaus-Gaddum type. 774-780 - Ioan Tomescu:
On the chromaticity of sunflower hypergraphs SH(n, p, h). 781-786
Volume 307, Numbers 7-8, April 2007
- Mirko Hornák, Stanislav Jendrol':
Preface. 787 - Michael D. Plummer:
Graph factors and factorization: 1985-2003: A survey. 791-821 - Gábor Bacsó, Zsolt Tuza, Margit Voigt:
Characterization of graphs dominated by induced paths. 822-826 - Halina Bielak:
Relations between 2-local and 2-mean Ramsey numbers for graphs. 827-831 - Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto:
Toughness and hamiltonicity in k-trees. 832-838 - Frank Bullock, Marietjie Frick, Gabriel Semanisin, Róbert Vlacuha:
Nontraceable detour graphs. 839-853 - Igor Fabrici, Tomás Madaras:
The structure of 1-planar graphs. 854-865 - Igor Fabrici:
Light graphs in families of outerplanar graphs. 866-872 - Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer:
Degree conditions for hamiltonicity: Counting the number of missing edges. 873-877 - Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs. 878-884 - Marietjie Frick, Joy Singleton:
Cubic maximal nontraceable graphs. 885-891 - Tobias Gerlach, Jochen Harant:
On a cycle through a specified linear forest of a graph. 892-895 - Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments. 896-904 - Erhard Hexel:
On short paths through prescribed vertices of a graph. 905-910 - Bill Jackson, G. Sethuraman, Carol A. Whitehead:
A note on the Erdos-Farber-Lovász conjecture. 911-915 - Arnfried Kemnitz, Massimiliano Marangio, Peter Mihók:
[r, s, t]-Chromatic numbers and hereditary properties of graphs. 916-922 - Daniel Král:
Mixed hypergraphs and other coloring problems. 923-938 - Tomás Madaras, Riste Skrekovski:
Lightness, heaviness and gravity. 939-951 - Danuta Michalak:
Hereditarily dominated graphs. 952-957 - Peter Mihók, Gabriel Semanisin:
On invariants of hereditary graph properties. 958-963 - Minh Hoang Nguyen, Mirka Miller, Joan Gimbert:
On mixed Moore graphs. 964-970 - Monika Pilsniak:
Packing of two digraphs into a transitive tournament. 971-974 - A. N. M. Salman, Hajo Broersma:
On Ramsey numbers for paths versus wheels. 975-982 - Jens Schreyer:
Almost every graph is vertex-oblique. 983-989 - Zdzislaw Skupien:
BCH codes and distance multi- or fractional colorings in hypercubes asymptotically. 990-1000 - Milan Tuhársky:
Light stars in large polyhedral maps on surfaces. 1001-1012 - Margit Voigt:
A non-3-choosable planar graph without cycles of length 4 and 5. 1013-1015 - Maciej Zwierzchowski:
Total domination number of the conjunction of graphs. 1016-1020
Volume 307, Numbers 9-10, May 2007
- Davide Baccherini, Donatella Merlini, Renzo Sprugnoli:
Binary words excluding a pattern and proper Riordan arrays. 1021-1037 - Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez:
New exact values of the maximum size of graphs free of topological complete subgraphs. 1038-1046 - T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. T. Ng:
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven. 1047-1053 - Peter Couperus:
Circulant covers of trivalent circulants. 1054-1064 - Murilo Vicente Gonçalves da Silva, Kristina Vuskovic:
Triangulated neighborhoods in even-hole-free graphs. 1065-1073 - Michelle R. DeDeo, Dominic Lanphier, Marvin Minei:
The spectrum of Platonic graphs over finite fields. 1074-1081 - Arturas Dubickas:
On a sequence related to that of Thue-Morse and its applications. 1082-1093 - Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth:
Codes identifying sets of vertices in random networks. 1094-1107 - Ronald J. Gould, John R. Schmitt:
Minimum degree and the minimum size of K22-saturated graphs. 1108-1114 - Michael A. Henning, Preben D. Vestergaard:
Domination in partitioned graphs with minimum degree two. 1115-1135 - S. S. Kamath, R. S. Bhat:
On strong (weak) independent sets and vertex coverings of a graph. 1136-1145 - Esamel M. Paluga, Sergio R. Canoy Jr.:
Monophonic numbers of the join and composition of connected graphs. 1146-1154 - Shane P. Redmond:
On zero-divisor graphs of small finite commutative rings. 1155-1166 - Jian-Hua Yin, Jiong-Sheng Li:
Potentially Kr1, r2, ..., rl, r, s-graphic sequences. 1167-1177
- Xinhui An, Baoyindureng Wu:
Hamiltonicity of complements of middle graphs. 1178-1184 - George E. Andrews, James A. Sellers:
On Sloane's generalization of non-squashing stacks of boxes. 1185-1190 - Anthony B. Evans:
Representations of disjoint unions of complete graphs. 1191-1198 - Vladimir Gurvich:
On the misere version of game Euclid and miserable games. 1199-1204 - Mingchu Li, Cheng Guo, Liming Xiong, Dengxin Li, Hong-Jian Lai:
Quadrangularly connected claw-free graphs. 1205-1211 - Frédéric Maffray, Dieter Rautenbach:
Small step-dominating sets in trees. 1212-1215
- Hong-Jian Lai, Xiangjuan Yao:
Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117]. 1217 - Simon R. Blackburn, Igor E. Shparlinski:
Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. 1218-1219
Volume 307, Numbers 11-12, May 2007
- Rafal Kalinowski, Mariusz Meszka:
Preface. 1221-1222 - Mieczyslaw Borowiecki, Elzbieta Sidorowicz:
Generalised game colouring of graphs. 1225-1231 - Martin Baca, Yuqing Lin, Mirka Miller, Maged Z. Youssef:
Edge-antimagic graphs. 1232-1244 - Halina Bielak:
Chromatic properties of hamiltonian graphs. 1245-1254 - Camino Balbuena, Xavier Marcote:
Lower connectivities of regular graphs with small diameter. 1255-1265 - Frank Bullock, Marietjie Frick, Joy Singleton:
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs. 1266-1275 - Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela:
Graphs without minor complete subgraphs. 1276-1284 - Jean E. Dunbar, Marietjie Frick:
The Path Partition Conjecture is true for claw-free graphs. 1285-1290 - Hao Li, Evelyne Flandrin, Jinlong Shu:
A sufficient condition for cyclability in directed graphs. 1291-1297 - Ewa Drgas-Burchardt, Anna Fiedorowicz:
Cost colourings of hypergraphs. 1298-1305 - Domingos Moreira Cardoso, Paula Rama:
Spectral results on regular graphs with (k, tau)-regular sets. 1306-1316 - Dalibor Froncek:
Bi-cyclic decompositions of complete graphs into spanning trees. 1317-1322 - Alastair Farrugia:
Dually vertex-oblique graphs. 1323-1331 - Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Fixed-point-free embeddings of digraphs with small size. 1332-1340 - Jaroslaw Grytczuk:
Pattern avoidance on graphs. 1341-1346 - Erik Bruoth, Mirko Hornák:
A lower bound for on-line ranking number of a path. 1347-1355 - Michael A. Henning:
Restricted domination in graphs with minimum degree 2. 1356-1366 - Joanna Górska, Zdzislaw Skupien:
Trees with maximum number of maximal matchings. 1367-1377 - Martin Baca, Stanislav Jendrol', Mirka Miller, Joseph F. Ryan:
On irregular total labellings. 1378-1388 - Bostjan Bresar, Sandi Klavzar:
Maximal proper subgraphs of median graphs. 1389-1394 - Marián Klesc, Anna Kocúrová:
The crossing numbers of products of 5-vertex graphs with cycles. 1395-1403 - Mikio Kano, Gyula Y. Katona:
Structure theorem and algorithm on (1, f)-odd subgraph. 1404-1417 - Mieczyslaw Borowiecki, Ewa Lazuka:
On chromaticity of hypergraphs. 1418-1429 - Tomás Madaras, Riste Skrekovski, Heinz-Jürgen Voss:
The 7-cycle C7 is light in the family of planar graphs with minimum degree 5. 1430-1435 - Zhiquan Hu, Hao Li:
Partition of a graph into cycles and vertices. 1436-1440 - Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo:
On the connectivity of cages with girth five, six and eight. 1441-1446 - Adam Nadolski:
The circular chromatic index of some class 2 graphs. 1447-1454 - Oleg Pikhurko:
Trees are almost prime. 1455-1462 - Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A Chvátal-Erdos type condition for pancyclability. 1463-1466 - Michael A. Henning, Dieter Rautenbach:
On the irregularity of bipartite graphs. 1467-1472 - Stefan Porschen:
On generalizations of the shadow independent set problem. 1473-1485 - Elzbieta Sidorowicz:
Size of weakly saturated graphs. 1486-1492 - Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer:
Independence number and vertex-disjoint cycles. 1493-1498 - Günter Schaar, Zdzislaw Skupien:
Pairs of trees in tree-tree triangulations. 1499-1505 - Dries Van Dyck, Veerle Fack:
On the reduction of Yutsis graphs. 1506-1515 - Jean-Luc Fouquet, Jean-Marie Vanherpe:
On bipartite graphs with weak density of some subgraphs. 1516-1524 - Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda:
Bipartite graphs with every matching in a cycle. 1525-1537 - Jens Schreyer, Hansjoachim Walther, Leonid S. Melnikov:
Vertex-oblique graphs. 1538-1544
- Rafal Kalinowski, Mariusz Meszka:
Research Problems from the Fourth Cracow Conference (Czorsztyn, 2002). 1545-1549
Volume 307, Number 13, June 2007
- Yuichiro Fujiwara:
Halving Steiner 2-designs. 1551-1558 - Jean-Luc Baril:
Gray code for permutations with a fixed number of cycles. 1559-1571 - Owen D. Byer, Deirdre Longacher Smeltzer:
Edge bounds in nonhamiltonian k-connected graphs. 1572-1579 - G. R. Omidi, Mohammad Reza Pournaki, Behruz Tayfeh-Rezaie:
3-Designs with block size 6 from PSL(2, q) and their large sets. 1580-1588 - Jun-Ming Xu, Yezhou Wu, Jia Huang, Chao Yang:
Feedback numbers of Kautz digraphs. 1589-1599 - Simeon Ball, Elisa Montanucci:
Affine blocking sets, three-dimensional codes and the Griesmer bound. 1600-1608 - João Araújo, Janusz Konieczny:
A method of finding automorphism groups of endomorphism monoids of relational systems. 1609-1620 - F. Levstein, Carolina Maldonado:
The Terwilliger algebra of the Johnson schemes. 1621-1635 - Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Dominating direct products of graphs. 1636-1642 - Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer:
Total restrained domination in trees. 1643-1650 - Nawarat Ananchuen, Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The odd case. 1651-1658 - Elizabeth J. Billington, Benjamin R. Smith, Dean G. Hoffman:
Equipartite gregarious 6- and 8-cycle systems. 1659-1667
- Stefanie Gerke, Melanie Raemy:
Generalised acyclic edge colourings of graphs with large girth. 1668-1671 - Florian Luca:
A generalization of a classical zero-sum problem. 1672-1678 - Mingquan Zhan:
Vertex pancyclicity in quasi claw-free graphs. 1679-1683 - Mickaël Montassier:
A small non-Z4-colorable planar graph. 1684-1686 - Hui-Qin Cao, Zhi-Wei Sun:
On the number of zero-sum subsequences. 1687-1691
Volume 307, Number 14, June 2007
- Devin Henson, Dinesh G. Sarvate, Spencer P. Hurd:
Group divisible designs with three groups and block size four. 1693-1706 - Satoshi Murai:
Algebraic shifting of cyclic polytopes and stacked polytopes. 1707-1721 - Francis C. S. Brown, Thomas M. A. Fink, Karen Willbrand:
On arithmetic and asymptotic properties of up-down numbers. 1722-1736 - Sergei L. Bezrukov, Roberto Battiti:
On partitioning of hypergraphs. 1737-1753 - Yuejian Peng:
Using Lagrangians of hypergraphs to find non-jumping numbers(II). 1754-1766 - Charles L. Dunn:
The relaxed game chromatic index of k-degenerate graphs. 1767-1775 - R. Julian R. Abel, Ahmed M. Assaf, Frank E. Bennett, Iliya Bluskov, Malcolm Greig:
Pair covering designs with block size 5. 1776-1791 - Eric S. Egge:
Restricted colored permutations and Chebyshev polynomials. 1792-1800 - Yoko Hasegawa, Akira Saito:
Graphs with small boundary. 1801-1807 - Gerard J. Chang, Changhong Lu, Sanming Zhou:
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups. 1808-1817
- K. S. Sudeep, Sundar Vishwanathan:
Some results in square-free and strong square-free edge-colorings of graphs. 1818-1824 - Axel Hultman:
The topology of spaces of phylogenetic trees with symmetry. 1825-1832
Volume 307, Number 15, July 2007
- David Tankus, Michael Tarsi:
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. 1833-1843 - Jocelyn Quaintance:
Combinatoric enumeration of two-dimensional proper arrays. 1844-1864 - Krzysztof Kolodziejczyk, Daria Olszewska:
A proof of Coleman's conjecture. 1865-1872 - Xiebin Chen:
The number of spanning trees in directed circulant graphs with non-fixed jumps. 1873-1880 - Jia Huang, Jun-Ming Xu:
The bondage numbers of graphs with small crossing numbers. 1881-1897 - Xuelian Wen, Dingjun Lou:
Characterizing defect n-extendable bipartite graphs with different connectivities. 1898-1908 - Max I. Kanovich:
The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map. 1909-1935 - Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano:
Matroids on convex geometries (cg-matroids). 1936-1950
- Armen S. Asratian, Carl Johan Casselgren:
On interval edge colorings of (alpha, beta)-biregular bipartite graphs. 1951-1956
- Mihai Ciucu:
A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order. 1957-1960 - Jeong Han Kim, Benny Sudakov, Van H. Vu:
Small subgraphs of random regular graphs. 1961-1967
Volume 307, Number 16, July 2007
- Jaroslav Nesetril, Martin Bálek:
Preface. 1969-1971 - Alexandre Tiskin:
Packing tripods: Narrowing the density gap. 1973-1981 - Tomás Dvorák, Petr Gregor:
Hamiltonian paths with prescribed edges in hypercubes. 1982-1998 - Sul-Young Choi, Puhua Guan:
Construction of a family of graphs with a small induced proper subgraph with minimum degree 3. 1999-2001 - Marek Janata:
About a new class of matroid-inducing packing families. 2002-2007 - Yon Dourisboure, Cyril Gavoille:
Tree-decompositions with bags of small diameter. 2008-2029 - Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul:
Can transitive orientation make sandwich problems easier? 2030-2041 - Janka Chlebíková, Klaus Jansen:
The d-precoloring problem for k-degenerate graphs. 2042-2052 - Rostislav Caha, Václav Koubek:
Spanning multi-paths in hypercubes. 2053-2066 - Ladislav Nebesky:
The interval function of a connected graph and road systems. 2067-2073 - Eyal Beigman:
Extension of Arrow's theorem to symmetric sets of tournaments. 2074-2081 - Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Complexity issues on bounded restrictive H-coloring. 2082-2093 - Stephen Finbow, Andrew D. King, Gary MacGillivray, Romeo Rizzi:
The firefighter problem for graphs of maximum degree three. 2094-2105 - Yared Nigussie:
Algorithm for finding structures and obstructions of tree ideals. 2106-2111 - Daniel Gonçalves:
Caterpillar arboricity of planar graphs. 2112-2121 - Susumu Suzuki, Toshihide Ibaraki:
The complexity of assigning genotypes to people in a pedigree consistently. 2122-2131 - Guillaume Fertin, André Raspaud:
L(p, q) labeling of d-dimensional grids. 2132-2140 - Fabrice Bazzaro, Mickaël Montassier, André Raspaud:
(d, 1)-total labelling of planar graphs with large girth and high maximum degree. 2141-2151
Volume 307, Numbers 17-18, August 2007
- Endre Boros, Yves Crama, Bruno Simeone:
Peter Ladislaw Hammer. 2153-2155
- Aleksander Malnic, Dragan Marusic, Stefko Miklavic, Primoz Potocnik:
Semisymmetric elementary abelian covers of the Möbius-Kantor graph. 2156-2175 - Anne Bertrand-Mathis:
Traces of algebraic integers and dynamical systems. 2176-2186 - Daniel C. Slilaty, Hongxun Qin:
Decompositions of signed-graphic matroids. 2187-2199 - Robert Cowen, Stephen H. Hechler, John W. Kennedy, Arthur Steinberg:
Odd neighborhood transversals on grid graphs. 2200-2208 - Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah:
On k-independence in graphs with emphasis on trees. 2209-2216 - Jennifer D. Key, P. Seneviratne:
Codes from the line graphs of complete multipartite graphs and PD-sets. 2217-2225 - Guantao Chen, Xuechao Li, Zhengsheng Wu, Xingping Xu:
The neighborhood union of independent sets and hamiltonicity of graphs. 2226-2234 - Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich:
The structure of well-covered graphs with no cycles of length 4. 2235-2245 - Vito Napolitano:
Finite {0, s, 2s}-affine linear spaces. 2246-2260 - Bruno Teheux:
Lattice of subalgebras in the finitely generated varieties of MV-algebras. 2261-2275 - Peter Arpin, Václav Linek:
Reachability problems in edge-colored digraphs. 2276-2289 - R. J. Waters:
Some new bounds on Tr-choosability. 2290-2299 - Thomas Britz:
Higher support matroids. 2300-2308
- Terry A. McKee:
Chordal multipartite graphs and chordal colorings. 2309-2314 - Jessica Muntz, Sivaram Narayan, Noah Streib, Kelly Van Ochten:
Optimal pebbling of graphs. 2315-2321 - Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
New results on the Zarankiewicz problem. 2322-2327
Volume 307, Numbers 19-20, September 2007
- Douglas B. West:
Editorial Announcement: Hello, World. 2329 - Paolo Dulio, Carla Peri:
On the geometric structure of lattice U-polygons. 2330-2340 - Jennifer Galovich, Dennis E. White:
Mahonian Z statistics. 2341-2350 - Palash Sarkar, Subhamoy Maitra:
Balancedness and correlation immunity of symmetric Boolean functions. 2351-2358 - Mehmet Cenkci, F. T. Howard:
Notes on degenerate numbers. 2359-2375 - D. Belotserkovsky:
The smallest number of edges in a 2-connected graph with specified diameter. 2376-2384 - René van den Brink, Gerard van der Laan:
Potentials and reduced games for share functions. 2385-2399 - Michela Pagliacci:
Kazhdan-Lusztig R-polynomials of permutations containing a 231 or 312 pattern. 2400-2414 - Imed Boudabbous, Pierre Ille:
Critical and infinite directed graphs. 2415-2428 - Ou Jianping:
A bound on 4-restricted edge connectivity of graphs. 2429-2437 - Aifeng Yang, Jinjiang Yuan:
On the vertex arboricity of planar graphs of diameter two. 2438-2447
Volume 307, Number 21, October 2007
- Shane P. Redmond:
Corrigendum to "On zero-divisor graphs of small finite commutative rings": [Discrete Math. 307(2007) 1155-1166]. 2449-2452
- Hong Yan, Xiaoqi Yang, Erfang Shan:
Upper minus total domination in small-degree regular graphs. 2453-2463 - Frantisek Matús:
Adhesivity of polymatroids. 2464-2477 - Liming Xiong, Mingchu Li:
On the 2-factor index of a graph. 2478-2483 - Michael J. Dinneen, Rongwei Lai:
Properties of vertex cover obstructions. 2484-2500 - Gi-Sang Cheon, Ian M. Wanless:
An interpretation of the Dittert conjecture in terms of semi-matchings. 2501-2507 - Vidya Venkateswaran:
A new class of multiset Wilf equivalent pairs. 2508-2513 - Jörn Quistorff:
On Rosenbloom and Tsfasman's generalization of the Hamming space. 2514-2524 - José Gómez:
Solution of the conjecture: If n=0(mod 4), n>4, then Kn has a super vertex-magic total labeling. 2525-2534 - Matthias R. Engelhardt:
A group-based search for solutions of the n-queens problem. 2535-2551 - Tetsuo Harada, Makoto Tagami:
A Riemann hypothesis analogue for invariant rings. 2552-2568 - Ján Karabás, Peter Malicky, Roman Nedela:
Three-manifolds with Heegaard genus at most two represented by crystallisations with at most 42 vertices. 2569-2590 - Caroline J. Klivans:
Threshold graphs, shifted complexes, and graphical complexes. 2591-2597 - Nicola Apollonio, Paolo Giulio Franciosa:
A characterization of partial directed line graphs. 2598-2614
- Martin Sonntag:
A characterization of hypercacti. 2615-2621 - Heping Zhang, Guangfu Wang:
A characterization of the interval distance monotone graphs. 2622-2627 - Youngmee Koh, Sangwook Ree:
Connected permutation graphs. 2628-2635 - Yoshio Sano:
The principal numbers of K. Saito for the types Al, Dl and El. 2636-2642 - Julie Haviland:
Upper bounds for independent domination in regular graphs. 2643-2646 - Geir Agnarsson, Magnús M. Halldórsson:
Strongly simplicial vertices of powers of trees. 2647-2652
Volume 307, Number 22, October 2007
- Dong Yeol Oh:
Corrigendum to "A classification of the structures of some Sperner families and superimposed codes": [Discrete Math. 306 (2006) 1722-1731]. 2653 - Han Ren, Mo Deng:
Minimum cycle bases of graphs on surfaces. 2654-2660 - Caterina De Simone, Raffaele Mosca:
Stable set and clique polytopes of (P5, gem)-free graphs. 2661-2670 - Svetoslav Savchev, Fang Chen:
Long zero-free sequences in finite cyclic groups. 2671-2679 - Bart De Bruyn:
Hyperplanes of DW(2n-1, q), q != 2, without ovoidal quads. 2680-2694 - Andreas Klein, Klaus Metsch:
Parameters for which the Griesmer bound is not sharp. 2695-2703 - Norbert Polat:
Netlike partial cubes I. General properties. 2704-2722 - Arthur Hoffmann-Ostenhof:
A counterexample to the bipartizing matching conjecture. 2723-2733 - Frank Gurski, Egon Wanke:
Line graphs of bounded clique-width. 2734-2754 - Torsten Muetze:
Generalized switch-setting problems. 2755-2770 - Pak Tung Ho:
The crossing number of C(3k+1;{1, k}). 2771-2774 - Bill Jackson, Kiyoshi Yoshimoto:
Even subgraphs of bridgeless graphs and 2-factors of line graphs. 2775-2785 - Xiande Zhang, Gennian Ge:
On the existence of partitionable skew Room frames. 2786-2807 - Kiyoshi Yoshimoto:
On the number of components in 2-factors of claw-free graphs. 2808-2819 - Weifan Wang, Min Chen:
On 3-colorable planar graphs without prescribed cycles. 2820-2825 - Dario Fasino, Domenico Freni:
Existence of proper semihypergroups of type U on the right. 2826-2836 - Mikhail Ju. Moshkov:
On the class of restricted linear information systems. 2837-2844 - Peter Dankelmann, David P. Day, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus, Henda C. Swart:
On equality in an upper bound for the restrained and total domination numbers of a graph. 2845-2852 - Alewyn P. Burger, Jan H. van Vuuren:
Balanced minimum covers of a finite set. 2853-2860 - Guangjun Zhao, Hong Feng:
A new q-analogue of the sum of cubes. 2861-2865 - Daniel W. Cranston, Ivan Hal Sudborough, Douglas B. West:
Short proofs for cut-and-paste sorting of permutations. 2866-2870 - William M. Y. Goh, Pawel Hitczenko:
Gaps in samples of geometric random variables. 2871-2890 - Zhao Zhang:
Sufficient conditions for restricted-edge-connectivity to be optimal. 2891-2899 - Bart De Bruyn:
The generating rank of the U4(3) near hexagon. 2900-2905 - Frédéric Gardi:
The Roberts characterization of proper and unit interval graphs. 2906-2908
Volume 307, Number 23, November 2007
- Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Counting strings in Dyck paths. 2909-2924 - Anna S. Lladó, Jordi Moragas:
Cycle-magic graphs. 2925-2933 - Shinya Fujita, Akira Saito, Tomoki Yamashita:
Edge-dominating cycles in graphs. 2934-2942 - Jordi Lopez-Abad:
Canonical equivalence relations on nets of PSc0. 2943-2978 - Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinson:
Counting labeled general cubic graphs. 2979-2992 - Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
The structure of K3, 3-subdivision-free toroidal graphs. 2993-3005 - Nawarat Ananchuen, Michael D. Plummer:
3-Factor-criticality in domination critical graphs. 3006-3015 - Charlotte A. C. Brennan:
Value and position of large weak left-to-right maxima for samples of geometrically distributed variables. 3016-3030 - Bolian Liu:
The period and base of a reducible sign pattern matrix. 3031-3039 - Pavel Nejedlý:
Choosability of graphs with infinite sets of forbidden differences. 3040-3047 - Robert E. L. Aldred, Richard P. Anstee, Stephen C. Locke:
Perfect matchings after vertex deletions. 3048-3054 - Genghua Fan, Lingli Sun:
The Erdös-Sós conjecture for spiders. 3055-3062 - Rahul Muthu, N. Narayanan, C. R. Subramanian:
Improved bounds on acyclic edge colouring. 3063-3069 - Jason P. Bell:
p-adic valuations and k-regular sequences. 3070-3075 - Hong-Jian Lai, Xiangwen Li, Gexin Yu:
An inequality for the group chromatic number of a graph. 3076-3080
Volume 307, Number 24, November 2007
- Yonglin Cao:
On the multiplicative monoid of n×n matrices over Zpm. 3081-3096 - Lutz Volkmann:
Multipartite tournaments: A survey. 3097-3129 - Michael Z. Spivey:
Combinatorial sums and finite differences. 3130-3146 - Fujine Yano, Hiroaki Yoshida:
Some set partition statistics in non-crossing partitions and generating functions. 3147-3160 - Rohan Cattell:
Graceful labellings of paths. 3161-3176 - Dieter Rautenbach:
Dominating and large induced trees in regular graphs. 3177-3186 - Vladimir Nikiforov:
The sum of the squares of degrees: Sharp asymptotics. 3187-3193 - Robert R. Rubalcaba, Peter J. Slater:
Roman dominating influence parameters. 3194-3200 - Satoshi Kamei:
Deciding nonconstructibility of 3-balls with spanning edges and interior vertices. 3201-3206 - Lutz Volkmann:
Local-edge-connectivity in digraphs and oriented graphs. 3207-3212 - Irene Stella, Lutz Volkmann, Stefan Winzen:
Strongly 4-path-connectivity in almost regular multipartite tournaments. 3213-3219 - Mohammad Ghebleh:
The circular chromatic index of Goldberg snarks. 3220-3225
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-12-04 01:29 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:
