Characterizing degree-sum maximal nonhamiltonian bipartite graphsFERRARA, Michael; JACOBSON, Michael; POWELL, Jeffrey et al.Discrete mathematics. 2012, Vol 312, Num 2, pp 459-461, issn 0012-365X, 3 p.Article

Derivative polynomials and enumeration of permutations by number of interior and left peaksMA, Shi-Mei.Discrete mathematics. 2012, Vol 312, Num 2, pp 405-412, issn 0012-365X, 8 p.Article

Face vectors of subdivided simplicial complexesDELUCCHI, Emanuele; PIXTON, Aaron; SABALKA, Lucas et al.Discrete mathematics. 2012, Vol 312, Num 2, pp 248-257, issn 0012-365X, 10 p.Article

Nonrepetitive vertex colorings of graphsHARANT, Jochen; JENDROL', Stanislav.Discrete mathematics. 2012, Vol 312, Num 2, pp 374-380, issn 0012-365X, 7 p.Article

On a conjecture of Murty and Simon on diameter two critical graphs IIHAYNES, Teresa W; HENNING, Michael A; YEO, Anders et al.Discrete mathematics. 2012, Vol 312, Num 2, pp 315-323, issn 0012-365X, 9 p.Article

On upper bounds for parameters related to the construction of special maximum matchingsKHOJABAGHYAN, Artur; MKRTCHYAN, Vahan V.Discrete mathematics. 2012, Vol 312, Num 2, pp 213-220, issn 0012-365X, 8 p.Article

Some structural properties of planar graphs and their applications to 3-choosabilityMIN CHEN; MONTASSIER, Mickaël; RASPAUD, Andre et al.Discrete mathematics. 2012, Vol 312, Num 2, pp 362-373, issn 0012-365X, 12 p.Article

The maximum diameter of total domination edge-critical graphsHENNING, Michael A; VAN DER MERWE, Lucas C.Discrete mathematics. 2012, Vol 312, Num 2, pp 397-404, issn 0012-365X, 8 p.Article

Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubesPOLAT, Norbert.Discrete mathematics. 2012, Vol 312, Num 1, pp 61-73, issn 0012-365X, 13 p.Article

The edge covering number of the intersection of two matroidsAHARONI, Ron; BERGER, Eli; ZIV, Ran et al.Discrete mathematics. 2012, Vol 312, Num 1, pp 81-85, issn 0012-365X, 5 p.Article

Symmetry properties of subdivision graphsDANESHKHAH, Ashraf; DEVILLERS, Alice; PRAEGER, Cheryl E et al.Discrete mathematics. 2012, Vol 312, Num 1, pp 86-93, issn 0012-365X, 8 p.Article

How to play Reverse HexHAYWARD, Ryan B; TOFT, Bjarne; HENDERSON, Philip et al.Discrete mathematics. 2012, Vol 312, Num 1, pp 148-156, issn 0012-365X, 9 p.Article

Recognizing triangulated Cartesian graph productsAFZAL, Shehzad; BRAND, Clemens.Discrete mathematics. 2012, Vol 312, Num 1, pp 188-193, issn 0012-365X, 6 p.Article

On the classification of algebraic function fields of class number threePICONE, Alberto.Discrete mathematics. 2012, Vol 312, Num 3, pp 637-646, issn 0012-365X, 10 p.Conference Paper

The Lemma of Tangents reformulatedCOOLSAET, K.Discrete mathematics. 2012, Vol 312, Num 3, pp 705-714, issn 0012-365X, 10 p.Conference Paper

A combinatorial approach to height sequences in finite partially ordered setsBIRO, Csaba; TROTTER, William T.Discrete mathematics. 2011, Vol 311, Num 7, pp 563-569, issn 0012-365X, 7 p.Article

A combinatorial proof of the Dense Hindman's TheoremTOWSNER, Henry.Discrete mathematics. 2011, Vol 311, Num 14, pp 1380-1384, issn 0012-365X, 5 p.Article

A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalenceVALLEE, Thierry; BRETTO, Alain.Discrete mathematics. 2011, Vol 311, Num 5, pp 336-341, issn 0012-365X, 6 p.Article

A note on the monotonicity of mixed Ramsey numbersAXENOVICH, Maria; CHOI, Jihyeok.Discrete mathematics. 2011, Vol 311, Num 17, pp 2020-2023, issn 0012-365X, 4 p.Article

Acyclic vertex coloring of graphs of maximum degree 5YADAV, Kishore; VARAGANI, Satish; KOTHAPALLI, Kishore et al.Discrete mathematics. 2011, Vol 311, Num 5, pp 342-348, issn 0012-365X, 7 p.Article

Bounds on treesSOKIC, Miodrag.Discrete mathematics. 2011, Vol 311, Num 6, pp 398-407, issn 0012-365X, 10 p.Article

Box-respecting colorings of n-dimensional guillotine-partitionsKESZEGH, Balázs.Discrete mathematics. 2011, Vol 311, Num 8-9, pp 756-760, issn 0012-365X, 5 p.Article

Closure operation for even factors on claw-free graphsLIMING XIONG.Discrete mathematics. 2011, Vol 311, Num 16, pp 1714-1723, issn 0012-365X, 10 p.Article

Coding discretizations of continuous functionsROJAS, Cristobal; TROUBETZKOY, Serge.Discrete mathematics. 2011, Vol 311, Num 8-9, pp 620-627, issn 0012-365X, 8 p.Article

Combinatorial PDEs on Cayley and coset graphsLAL, A. K; MOHANTY, S; NILAKANTAN, N et al.Discrete mathematics. 2011, Vol 311, Num 22, pp 2587-2592, issn 0012-365X, 6 p.Article