Aurora Morgana

According to our database1, Aurora Morgana authored at least 27 papers between 1984 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Recognizing Well Covered Graphs of Families with Special P 4-Components.
Graphs Comb., 2013

2012
On clique-colouring of graphs with few P 4's.
J. Braz. Comput. Soc., 2012

On the classification problem for split graphs.
J. Braz. Comput. Soc., 2012

2009
The Graph Sandwich Problem for P<sub>4</sub>-sparse graphs.
Discret. Math., 2009

2008
Edge Coloring of Split Graphs.
Electron. Notes Discret. Math., 2008

Using Latin Squares to Color Split Graphs.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
Tutte sets in graphs I: Maximal tutte sets and D-graphs.
J. Graph Theory, 2007

Tutte sets in graphs II: The complexity of finding maximum Tutte sets.
Discret. Appl. Math., 2007

The K-behaviour of p-trees.
Ars Comb., 2007

2006
The clique operator on graphs with few <i>P</i><sub>4</sub>'s.
Discret. Appl. Math., 2006

2005
The P<sub>4</sub>-sparse Graph Sandwich Problem.
Electron. Notes Discret. Math., 2005

2004
The clique operator on cographs and serial graphs.
Discret. Math., 2004

An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid.
Discret. Appl. Math., 2004

2002
The induced path convexity, betweenness, and svelte graphs.
Discret. Math., 2002

Single bend wiring on surfaces.
Discret. Appl. Math., 2002

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.
Discret. Appl. Math., 2002

2001
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid.
Electron. Notes Discret. Math., 2001

2000
Path equipartition in the Chebyshev norm.
Eur. J. Oper. Res., 2000

1998
A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid.
Discret. Appl. Math., 1998

1997
The Complexity of Recognizing Tough Cubic Graphs.
Discret. Appl. Math., 1997

1994
On the complexity of recognizing tough graphs.
Discret. Math., 1994

1990
Long cycles in graphs with large degree sums.
Discret. Math., 1990

A simple proof of a theorem of Jung.
Discret. Math., 1990

On Line 2-Satisfiability.
Ann. Math. Artif. Intell., 1990

1988
Adamant digraphs.
Discret. Math., 1988

1984
Degree sequences of matrogenic graphs.
Discret. Math., 1984

Structure and recognition of domishold graphs.
Discret. Math., 1984


  Loading...