Márcia R. Cerioli

According to our database1, Márcia R. Cerioli authored at least 31 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
On Edge-magic Labelings of Forests.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2017
Transversals of Longest Paths.
Electron. Notes Discret. Math., 2017

2016
Intersection of Longest Paths in Graph Classes.
Electron. Notes Discret. Math., 2016

L(2, 1)-labelling of graphs with few P<sub>4</sub>'s.
Discret. Optim., 2016

2015
Structural Results for General Partition, Equistable and Triangle graphs.
Electron. Notes Discret. Math., 2015

2014
Decomposition by maxclique separators.
Discret. Math., 2014

2013
Total L(2, 1)-coloring of graphs.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
The interval count of interval graphs and orders: a short survey.
J. Braz. Comput. Soc., 2012

On L(2, 1)-coloring split, chordal bipartite, and weakly chordal graphs.
Discret. Appl. Math., 2012

On b-continuity of Distance-Hereditary Graphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation.
RAIRO Theor. Informatics Appl., 2011

On the <i>L</i>(2, 1)-labelling of block graphs.
Int. J. Comput. Math., 2011

On characterizations by nice forbidding sets.
Electron. Notes Discret. Math., 2011

On counting interval lengths of interval graphs.
Discret. Appl. Math., 2011

A partial characterization by forbidden subgraphs of edge path graphs.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Extreme Cliques in Interval Graphs.
Ars Comb., 2010

2009
On lambda-coloring split, chordal bipartite and weakly chordal graphs.
Electron. Notes Discret. Math., 2009

Clique-Coloring Circular-Arc Graphs.
Electron. Notes Discret. Math., 2009

2008
Clique-coloring UE and UEH graphs.
Electron. Notes Discret. Math., 2008

Linear-Interval Dimension and PI Orders.
Electron. Notes Discret. Math., 2008

Partition into cliques for cubic graphs: Planar case, complexity and approximation.
Discret. Appl. Math., 2008

2006
Characterizing Intersection Graphs of Substars of a Star.
Ars Comb., 2006

2005
Forbidden subgraph characterization of split graphs that are UEH.
Electron. Notes Discret. Math., 2005

Non loop graphs with induced cycles.
Electron. Notes Discret. Math., 2005

Loop Graphs and Asteroidal Sets.
Electron. Notes Discret. Math., 2005

2004
On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation.
Electron. Notes Discret. Math., 2004

Tree Loop Graphs.
Electron. Notes Discret. Math., 2004

2003
Clique Graphs and Edge-clique graphs.
Electron. Notes Discret. Math., 2003

2002
Edge clique graphs and some classes of chordal graphs.
Discret. Math., 2002

2001
A Characterization of Edge Clique Graphs.
Ars Comb., 2001

1998
The Homogeneous Set Sandwich Problem.
Inf. Process. Lett., 1998


  Loading...