Aurora Morgana

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