Aurora Morgana

Publication Activity (10 Years)

Years Active: 1984-2015
Publications (10 Years): 1

Top Topics

Graph Theoretic

Top Venues

J. Braz. Comput. Soc.

Publications

Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana
Edge-Coloring of Split Graphs. Ars Comb. 119 (2015)
Sulamita Klein, Célia Picinin de Mello, Aurora Morgana
Recognizing Well Covered Graphs of Families with Special P 4-Components. Graphs Comb. 29 (3) (2013)
Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana
On the classification problem for split graphs. J. Braz. Comput. Soc. 18 (2) (2012)
Sulamita Klein, Aurora Morgana
On clique-colouring of graphs with few P 4's. J. Braz. Comput. Soc. 18 (2) (2012)
Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana
-sparse graphs. Discret. Math. 309 (11) (2009)
Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana
Edge Coloring of Split Graphs. Electron. Notes Discret. Math. 30 (2008)
Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana
Using Latin Squares to Color Split Graphs. CTW (2008)
Marco Liverani, Aurora Morgana, Célia Picinin de Mello
The K-behaviour of p-trees. Ars Comb. 83 (2007)
Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec
Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discret. Appl. Math. 155 (10) (2007)
Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
Tutte sets in graphs I: Maximal tutte sets and D-graphs. J. Graph Theory 55 (4) (2007)
Célia Picinin de Mello, Aurora Morgana, Marco Liverani
's. Discret. Appl. Math. 154 (3) (2006)
Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana
-sparse Graph Sandwich Problem. Electron. Notes Discret. Math. 22 (2005)
Francisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña
The clique operator on cographs and serial graphs. Discret. Math. 282 (1-3) (2004)
Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid. Discret. Appl. Math. 141 (1-3) (2004)
Maria Angeles Garrido, Alberto Márquez, Aurora Morgana, José Ramón Portillo
Single bend wiring on surfaces. Discret. Appl. Math. 117 (1-3) (2002)
Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discret. Appl. Math. 120 (1-3) (2002)
Aurora Morgana, Henry Martyn Mulder
The induced path convexity, betweenness, and svelte graphs. Discret. Math. 254 (1-3) (2002)
Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid. Electron. Notes Discret. Math. 7 (2001)
Marco Liverani, Aurora Morgana, Bruno Simeone, Giovanni Storchi
Path equipartition in the Chebyshev norm. Eur. J. Oper. Res. 123 (2) (2000)
Yanpei Liu, Aurora Morgana, Bruno Simeone
A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid. Discret. Appl. Math. 81 (1-3) (1998)
Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel
The Complexity of Recognizing Tough Cubic Graphs. Discret. Appl. Math. 79 (1-3) (1997)
Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
On the complexity of recognizing tough graphs. Discret. Math. 124 (1-3) (1994)
Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel
Long cycles in graphs with large degree sums. Discret. Math. 79 (1) (1990)
Brigitte Jaumard, P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
On Line 2-Satisfiability. Ann. Math. Artif. Intell. 1 (1990)
Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
A simple proof of a theorem of Jung. Discret. Math. 79 (2) (1990)
P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
Adamant digraphs. Discret. Math. 69 (3) (1988)
P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
Degree sequences of matrogenic graphs. Discret. Math. 51 (1) (1984)
P. Marchioro, Aurora Morgana
Structure and recognition of domishold graphs. Discret. Math. 50 (1984)