Aurora Morgana - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2015

Edge-Coloring of Split GraphsSheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana. arscom, 119:363-375, 2015.

2012

On the classification problem for split graphsSheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana. jbcs, 18(2):95-101, 2012. [doi]

On clique-colouring of graphs with few P 4'sSulamita Klein, Aurora Morgana. jbcs, 18(2):113-119, 2012. [doi]

2009

The Graph Sandwich Problem for P::4::-sparse graphsSimone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana. DM, 309(11):3664-3673, 2009. [doi]

2008

Edge Coloring of Split GraphsSheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana. endm, 30:21-26, 2008. [doi]

Using Latin Squares to Color Split GraphsSheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana. colognetwente 2008: 123-126

2007

2006

The clique operator on graphs with few ::::P::::::4:: sCélia Picinin de Mello, Aurora Morgana, M. Liverani. DAM, 154(3):485-492, 2006. [doi]

2005

The P::4::-sparse Graph Sandwich ProblemSimone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana. endm, 22:185-188, 2005. [doi]

2004

The clique operator on cographs and serial graphsFrancisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña. DM, 282(1-3):183-191, 2004. [doi]

An algorithm for 1-bend embeddings of plane graphs in the two-dimensional gridAurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi. DAM, 141(1-3):225-241, 2004. [doi]

2002

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusionDouglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel. DAM, 120(1-3):13-23, 2002.

The induced path convexity, betweenness, and svelte graphsAurora Morgana, Henry Martyn Mulder. DM, 254(1-3):349-370, 2002. [doi]

2001

An algorithm for 1-bend embeddings of planar graphs in the two-dimensional gridAurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi. endm, 7:38-41, 2001. [doi]

2000

Path equipartition in the Chebyshev normMarco Liverani, Aurora Morgana, Bruno Simeone, Giovanni Storchi. eor, 123(2):428-435, 2000. [doi]

1998

A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional GridYanpei Liu, Aurora Morgana, Bruno Simeone. DAM, 81(1-3):69-91, 1998. [doi]

1997

The Complexity of Recognizing Tough Cubic GraphsDouglas Bauer, Willem-Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel. DAM, 79(1-3):35-44, 1997. [doi]

1994

On the complexity of recognizing tough graphsDouglas Bauer, Aurora Morgana, Edward F. Schmeichel. DM, 124(1-3):13-17, 1994. [doi]

1990

Long cycles in graphs with large degree sumsDouglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel. DM, 79(1):59-70, 1990. [doi]

A simple proof of a theorem of JungDouglas Bauer, Aurora Morgana, Edward F. Schmeichel. DM, 79(2):147-152, 1990. [doi]

On Line 2-SatisfiabilityBrigitte Jaumard, P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone. AMAI, 1:155-165, 1990.

1988

Adamant digraphsP. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone. DM, 69(3):253-261, 1988. [doi]

1984

Degree sequences of matrogenic graphsP. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone. DM, 51(1):47-61, 1984. [doi]

Structure and recognition of domishold graphsP. Marchioro, Aurora Morgana. DM, 50:239-251, 1984. [doi]

Sign in or sign up to see more results.

runs on WebDSL