Ermelinda DeLaViña

Available identifiers

Publication	Date of Publication	Type
A parallel algorithm for computing the critical independence number and related sets	2014-05-14	Paper
Graffiti.pc on the \(k\)-independence	2014-01-03	Paper
A characterization of graphs where the independence number equals the radius	2012-12-27	Paper
https://portal.mardi4nfdi.de/entity/Q3110093	2012-01-26	Paper
https://portal.mardi4nfdi.de/entity/Q3015634	2011-07-13	Paper
On total domination and support vertices of a tree	2011-07-04	Paper
Lower bounds for the domination number	2011-05-09	Paper
Bounds on the \(k\)-domination number of a graph	2011-04-05	Paper
https://portal.mardi4nfdi.de/entity/Q3582499	2010-09-02	Paper
A note on dominating sets and average distance	2009-06-19	Paper
Some elementary lower bounds on the matching number of bipartite graphs	2009-04-21	Paper
Spanning trees with many leaves and average distance	2009-04-07	Paper
Independence, radius and Hamiltonian paths	2008-07-03	Paper
https://portal.mardi4nfdi.de/entity/Q5443247	2008-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q5477958	2006-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q5477957	2006-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q5477956	2006-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4677823	2005-05-23	Paper
https://portal.mardi4nfdi.de/entity/Q4405768	2003-10-21	Paper
https://portal.mardi4nfdi.de/entity/Q4529454	2002-10-09	Paper
https://portal.mardi4nfdi.de/entity/Q4221695	1999-04-09	Paper
Ramseyan properties of graphs	1998-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4339430	1997-07-08	Paper

This page was built for person: Ermelinda DeLaViña