On the bondage number of planar and directed graphsCARLSON, Kelli; DEVELIN, Mike.Discrete mathematics. 2006, Vol 306, Num 8-9, pp 820-826, issn 0012-365X, 7 p.Article

Bounds on maximum b-matchingsWANGSEN FENG.Discrete mathematics. 2009, Vol 309, Num 12, pp 4160-4163, issn 0012-365X, 4 p.Article

An interpretation of the Dittert conjecture in terms of semi-matchingsCHEON, Gi-Sang; WANLESS, Ian M.Discrete mathematics. 2007, Vol 307, Num 21, pp 2501-2507, issn 0012-365X, 7 p.Article

Removable matchings and hamiltonian cyclesZHIQUAN HU; HAO LI.Discrete mathematics. 2009, Vol 309, Num 5, pp 1020-1024, issn 0012-365X, 5 p.Conference Paper

r-Strong edge colorings of graphsAKBARI, S; BIDKHORI, H; NOSRATI, N et al.Discrete mathematics. 2006, Vol 306, Num 23, pp 3005-3010, issn 0012-365X, 6 p.Conference Paper

Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K₃₀CETINA, M; HERNANDEZ-VELEZ, C; LEANOS, J et al.Discrete mathematics. 2011, Vol 311, Num 16, pp 1646-1657, issn 0012-365X, 12 p.Article

Basic perfect graphs and their extensionsZVEROVICH, Igor E; ZVEROVICH, Vadim E.Discrete mathematics. 2005, Vol 293, Num 1-3, pp 291-311, issn 0012-365X, 21 p.Conference Paper

Perfect hexagon triple systemsKÜCÜKCIFCI, Selda; LINDNER, C. C.Discrete mathematics. 2004, Vol 279, Num 1-3, pp 325-335, issn 0012-365X, 11 p.Article

Maximum number of edges joining vertices on a cubeABDEL-GHAFFAR, Khaled A. S.Information processing letters. 2003, Vol 87, Num 2, pp 95-99, issn 0020-0190, 5 p.Article

Embedding Steiner triple systems in hexagon triple systemsLINDNER, C. C; QUATTROCCHI, Gaetano; RODGER, C. A et al.Discrete mathematics. 2009, Vol 309, Num 2, pp 487-490, issn 0012-365X, 4 p.Conference Paper

Some remarks on λ_p,q-connectednessRAUTENBACH, Dieter; VOLKMANN, Lutz.Discrete mathematics. 2008, Vol 308, Num 23, pp 5562-5569, issn 0012-365X, 8 p.Article

Edges not contained in triangles and the number of contractible edges in a 4-connected graphANDO, Kiyoshi; EGAWA, Yoshimi.Discrete mathematics. 2008, Vol 308, Num 23, pp 5463-5472, issn 0012-365X, 10 p.Article

Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimalZHAO ZHANG; JINJIANG YUAN.Discrete mathematics. 2007, Vol 307, Num 2, pp 293-298, issn 0012-365X, 6 p.Article

List edge multicoloring in graphs with few cyclesMARX, Daniel.Information processing letters. 2004, Vol 89, Num 2, pp 85-90, issn 0020-0190, 6 p.Article

Superfluous edges and exponential expansions of De Bruijn and Kautz graphsCANALE, Eduardo A; GOMEZ, José.Discrete applied mathematics. 2004, Vol 138, Num 3, pp 303-331, issn 0166-218X, 29 p.Article

Characterization of digraphs with equal domination graphs and underlying graphsFACTORY, Kim A. S; LANGLEY, Larry J.Discrete mathematics. 2008, Vol 308, Num 1, pp 34-43, issn 0012-365X, 10 p.Article

A combinatorial proof of the Rayleigh formula for graphsCHOE, Youngbin.Discrete mathematics. 2008, Vol 308, Num 24, pp 5944-5953, issn 0012-365X, 10 p.Article

CROSSING STARS IN TOPOLOGICAL GRAPHSTARDOS, Gabor; TOTH, Géza.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 3, pp 737-749, issn 0895-4801, 13 p.Article

On the role of hypercubes in the resonance graphs of benzenoid graphsSALEM, Khaled; KLAVZAR, Sandi; GUTMAN, Ivan et al.Discrete mathematics. 2006, Vol 306, Num 7, pp 699-704, issn 0012-365X, 6 p.Article

A note on the edge cover chromatic index of multigraphsCHANGQING XU; GUIZHEN LIU.Discrete mathematics. 2008, Vol 308, Num 24, pp 6564-6568, issn 0012-365X, 5 p.Article

The bondage numbers of graphs with small crossing numbersJIA HUANG; XU, Jun-Ming.Discrete mathematics. 2007, Vol 307, Num 15, pp 1881-1897, issn 0012-365X, 17 p.Article

Solution of the conjecture : If n ≡ 0(mod 4), n > 4, then K_n has a super vertex-magic total labelingGOMEZ, J.Discrete mathematics. 2007, Vol 307, Num 21, pp 2525-2534, issn 0012-365X, 10 p.Article

An exact algorithm for the channel assignment problemKRAL, Daniel.Discrete applied mathematics. 2005, Vol 145, Num 2, pp 326-331, issn 0166-218X, 6 p.Article

On the small cycle transversal of planar graphsGE XIA; YONG ZHANG.Theoretical computer science. 2011, Vol 412, Num 29, pp 3501-3509, issn 0304-3975, 9 p.Article

On the red/blue spanning tree problemBEREG, Sergey; MINGHUI JIANG; BOTING YANG et al.Theoretical computer science. 2011, Vol 412, Num 23, pp 2459-2467, issn 0304-3975, 9 p.Article