2-Layer Right Angle Crossing DrawingsDI GIACOMO, Emilio; DIDIMO, Walter; EADES, Peter et al.Algorithmica. 2014, Vol 68, Num 4, pp 954-997, issn 0178-4617, 44 p.Article

A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave CornersHONG, Seok-Hee; NAGAMOCHI, Hiroshi.Algorithmica. 2012, Vol 62, Num 3-4, pp 1122-1158, issn 0178-4617, 37 p.Article

Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs : Foundations of Computer Science - Mathematical Foundations and Apllications of Algorithms and Computer ScienceZHUANG, Bingbing; NAGAMOCHI, Hiroshi.IEICE transactions on information and systems. 2011, Vol 94, Num 2, pp 211-219, issn 0916-8532, 9 p.Article

Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs : Foundations of Computer Science - Mathematical Foundations and Apllications of Algorithms and Computer ScienceZHUANG, Bingbing; NAGAMOCHI, Hiroshi.IEICE transactions on information and systems. 2011, Vol 94, Num 2, pp 200-210, issn 0916-8532, 11 p.Article

A note on acyclic edge coloring of complete bipartite graphsBASAVARAJU, Manu; SUNIL CHANDRAN, L.Discrete mathematics. 2009, Vol 309, Num 13, pp 4646-4648, issn 0012-365X, 3 p.Article

Adaptable chromatic number of graph productsHELL, Pavol; ZHISHI PAN; WONG, Tsai-Lien et al.Discrete mathematics. 2009, Vol 309, Num 21, pp 6153-6159, issn 0012-365X, 7 p.Article

An upper bound on the domination number of a graph with minimum degree 2FRENDRUP, Allan; HENNING, Michael A; RANDERATH, Bert et al.Discrete mathematics. 2009, Vol 309, Num 4, pp 639-646, issn 0012-365X, 8 p.Article

Average distance in graphs and eigenvaluesSIVASUBRAMANIAN, Sivaramakrishnan.Discrete mathematics. 2009, Vol 309, Num 10, pp 3458-3462, issn 0012-365X, 5 p.Article

Boxicity of Halin graphsSUNIL CHANDRAN, L; FRANCIS, Mathew C; SURESH, Santhosh et al.Discrete mathematics. 2009, Vol 309, Num 10, pp 3233-3237, issn 0012-365X, 5 p.Article

Closure, stability and iterated line graphs with a 2-factorSAITO, Akira; LIMING XIONG.Discrete mathematics. 2009, Vol 309, Num 16, pp 5000-5010, issn 0012-365X, 11 p.Article

Colouring games on outerplanar graphs and treesHUNGYUNG CHANG; XUDING ZHU.Discrete mathematics. 2009, Vol 309, Num 10, pp 3185-3196, issn 0012-365X, 12 p.Article

Complete r-partite subgraphs of dense r-graphsNIKIFOROV, Vladimir.Discrete mathematics. 2009, Vol 309, Num 13, pp 4326-4331, issn 0012-365X, 6 p.Article

Globally bi-3*-connected graphsKAO, Shin-Shin; HSU, Hong-Chun; HSU, Lih-Hsing et al.Discrete mathematics. 2009, Vol 309, Num 8, pp 1931-1946, issn 0012-365X, 16 p.Article

Minimal 2-matching-covered graphsSHAN ZHOU; HEPING ZHANG.Discrete mathematics. 2009, Vol 309, Num 13, pp 4270-4279, issn 0012-365X, 10 p.Article

On cyclic edge-connectivity of transitive graphsBING WANG; ZHAO ZHANG.Discrete mathematics. 2009, Vol 309, Num 13, pp 4555-4563, issn 0012-365X, 9 p.Article

On the chromaticity of complete multipartite graphs with certain edges addedLAU, G. C; PENG, Y. H.Discrete mathematics. 2009, Vol 309, Num 12, pp 4087-4092, issn 0012-365X, 6 p.Article

Quasi-kernels and quasi-sinks in infinite graphsERDÖS, Péter L; SOUKUP, Lajos.Discrete mathematics. 2009, Vol 309, Num 10, pp 3040-3048, issn 0012-365X, 9 p.Article

Some results on the incidence coloring number of a graphJIAOJIAO WU.Discrete mathematics. 2009, Vol 309, Num 12, pp 3864-3868, issn 0012-365X, 5 p.Article

Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2SHIYING WANG; SHANGWEI LIN; CHUNFANG LI et al.Discrete mathematics. 2009, Vol 309, Num 4, pp 908-919, issn 0012-365X, 12 p.Article

The maximum Randić index of chemical trees with k pendantsWAI CHEE SHIU; ZHANG, Lian-Zhu.Discrete mathematics. 2009, Vol 309, Num 13, pp 4409-4416, issn 0012-365X, 8 p.Article

Tree-length equals branch-lengthUMEZAWA, Maori; YAMAZAKI, Koichi.Discrete mathematics. 2009, Vol 309, Num 13, pp 4656-4660, issn 0012-365X, 5 p.Article

Weighted degrees and heavy cycles in weighted graphsFUJISAWA, Jun.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6483-6495, issn 0012-365X, 13 p.Article

A generalization of Tutte's theorem on Hamiltonian cycles in planar graphsHARANT, Jochen; SENITSCH, Stefan.Discrete mathematics. 2009, Vol 309, Num 15, pp 4949-4951, issn 0012-365X, 3 p.Conference Paper

All 2-connected in-tournaments that are cycle complementaryMEIERLING, Dirk; VOLKMANN, Lutz.Discrete mathematics. 2008, Vol 308, Num 11, pp 2115-2133, issn 0012-365X, 19 p.Article

Bandwidth of the corona of two graphsKOJIMA, Toru.Discrete mathematics. 2008, Vol 308, Num 17, pp 3770-3781, issn 0012-365X, 12 p.Article