Authors: Consoli, S., Moreno Pérez, J.A.

Superior Title: Electronic Notes in Discrete Mathematics; Dec2012, Vol. 39, p75-82, 8p

Subject Terms: GRAPH theory, PROBLEM solving, GRAPH labelings, SPANNING trees, HYBRID systems, METAHEURISTIC algorithms, MATHEMATICAL variables

Authors: Hefetz, Dan, Ferber, Asaf, Krivelevich, Michael

Superior Title: Electronic Notes in Discrete Mathematics; Dec2011, Vol. 38, p331-336, 6p

Subject Terms: EMBEDDINGS (Mathematics), SPANNING trees, GAME theory, PATHS & cycles in graph theory, COMBINATORIAL set theory, TOPOLOGICAL degree

Authors: Buß, Enno, Hàn, Hiệp, Schacht, Mathias

Superior Title: Electronic Notes in Discrete Mathematics; Dec2011, Vol. 38, p207-212, 6p

Subject Terms: PATHS & cycles in graph theory, TOPOLOGICAL degree, HAMILTONIAN graph theory, HYPERGRAPHS, SPANNING trees, ASYMPTOTIC expansions, MATHEMATICAL analysis

Authors: Urrutia, Sebastián, Lucena, Abílio

Superior Title: Electronic Notes in Discrete Mathematics; Aug2011, Vol. 37, p195-200, 6p

Subject Terms: SPANNING trees, INTEGER programming, LINEAR programming, ACYCLIC model, MATHEMATICAL models, POLYNOMIALS, DIAMETER

Authors: Heggernes, Pinar, van ʼt Hof, Pim, Lévêque, Benjamin, Christophe, Paul

Superior Title: Electronic Notes in Discrete Mathematics; Aug2011, Vol. 37, p87-92, 6p

Subject Terms: BIPARTITE graphs, TREE graphs, POLYNOMIALS, ALGORITHMS, SPANNING trees, NP-complete problems, SET theory, PROBLEM solving

Authors: Salamon, Gábor

Superior Title: Electronic Notes in Discrete Mathematics; Aug2010, Vol. 36, p1209-1216, 8p

Subject Terms: SPANNING trees, APPROXIMATION algorithms, PATHS & cycles in graph theory, HAMILTONIAN graph theory, PROBLEM solving, GRAPH connectivity

Authors: Gouveia, Luís, Moura, Pedro

Superior Title: Electronic Notes in Discrete Mathematics; Aug2010, Vol. 36, p985-992, 8p

Subject Terms: SPANNING trees, PATHS & cycles in graph theory, KNAPSACK problems, MATHEMATICAL formulas, LINEAR programming, COMPUTATIONAL complexity, DECOMPOSITION method

Authors: Conegundes Martinez, Leonardo, da Cunha, Alexandre Salles

Superior Title: Electronic Notes in Discrete Mathematics; Aug2010, Vol. 36, p311-318, 8p

Subject Terms: SPANNING trees, HEURISTIC algorithms, ELIMINATION (Mathematics), SET theory, MATHEMATICAL inequalities, LINEAR programming

Authors: Baumann, Frank, Buchheim, Christoph

Superior Title: Electronic Notes in Discrete Mathematics; Aug2010, Vol. 36, p239-246, 8p

Subject Terms: WIRELESS communications, SUBMODULAR functions, INTEGER programming, MATHEMATICAL formulas, MATHEMATICAL models, SPANNING trees

Authors: Ljubić, Ivana, Gollowitzer, Stefan

Superior Title: Electronic Notes in Discrete Mathematics; Aug2010, Vol. 36, p207-214, 8p

Subject Terms: LOCATION problems (Programming), GRAPH theory, GRAPH connectivity, SPANNING trees, MATHEMATICAL models, INTEGER programming

Authors: Galbiati, Giulia, Gualandi, Stefano, Maffioli, Francesco

Superior Title: Electronic Notes in Discrete Mathematics; Aug2010, Vol. 36, p81-88, 8p

Subject Terms: GRAPH coloring, SPANNING trees, INTEGER programming, COMPUTATIONAL complexity, PATHS & cycles in graph theory, MATHEMATICAL models

Authors: de Almeida, Ana Maria, Martins, Pedro, Souza, Maurício C.

Superior Title: Electronic Notes in Discrete Mathematics; Aug2010, Vol. 36, p9-15, 7p

Subject Terms: NP-complete problems, GRAPH theory, SPANNING trees, COMBINATORICS, GRAPH connectivity, MAXIMA & minima, COMPUTATIONAL complexity

Authors: Böttcher, Julia, Kohayakawa, Yoshiharu, Taraz, Anusch

Superior Title: Electronic Notes in Discrete Mathematics; Dec2009, Vol. 35, p335-340, 6p

Subject Terms: SPANNING trees, RANDOM graphs, ROBUST control, ARBITRARY constants, EXTREMAL problems (Mathematics), ASYMPTOTIC expansions, SPARSE matrices

Authors: Figueroa, Ana Paulina, Rivera-Campo, Eduardo

Superior Title: Electronic Notes in Discrete Mathematics; Dec2009, Vol. 35, p269-273, 5p

Subject Terms: MATROIDS, GRAPH coloring, SPANNING trees, MATHEMATICAL symmetry, MATHEMATICAL functions, MATHEMATICAL analysis

Authors: Simonetti, L., Frota, Y., de Souza, C.C.

Superior Title: Electronic Notes in Discrete Mathematics; Dec2009, Vol. 35, p83-88, 6p

Subject Terms: SPANNING trees, INITIAL value problems, GRAPH theory, HEURISTIC programming, INTEGER programming, COMBINATORICS, MATHEMATICAL optimization, ALGORITHMS

Authors: Ota, Katsuhiro, Ozeki, Kenta

Superior Title: Electronic Notes in Discrete Mathematics; Aug2009, Vol. 34, p145-149, 5p

Subject Terms: SPANNING trees, GRAPH connectivity, GRAPH theory, TOPOLOGICAL degree, COMBINATORICS

Authors: Gioan, Emeric, Las Vergnas, Michel

Superior Title: Electronic Notes in Discrete Mathematics; Aug2009, Vol. 34, p307-311, 5p

Subject Terms: LINEAR programming, GRAPH theory, ACYCLIC model, MATROIDS, ORDERED sets, MATHEMATICAL mappings, SPANNING trees, COMBINATORICS

Authors: Böttcher, Julia, Müller, Sybille

Superior Title: Electronic Notes in Discrete Mathematics; Aug2009, Vol. 34, p255-259, 5p

Subject Terms: SPANNING trees, GRAPH theory, GRAPH coloring, TOPOLOGICAL degree, EXISTENCE theorems, COMBINATORICS

Authors: Bang-Jensen, Jørgen, Kriesell, Matthias

Superior Title: Electronic Notes in Discrete Mathematics; Aug2009, Vol. 34, p179-183, 5p

Subject Terms: DIRECTED graphs, GRAPH theory, PATHS & cycles in graph theory, MATHEMATICAL decomposition, SPANNING trees, COMBINATORICS

Authors: Gonçalves, Daniel, Pinlou, Alexandre, Thomassé, Stéphan, Havet, Frédéric

Superior Title: Electronic Notes in Discrete Mathematics; Aug2009, Vol. 34, p139-143, 5p

Subject Terms: SPANNING trees, DIRECTED graphs, GALAXIES, NP-complete problems, GRAPH connectivity