L'udovít Niepel

Available identifiers

zbMath Open niepel.ludovitMaRDI QIDQ967347

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q2969111	2017-03-14	Paper
Locating-paired-dominating sets in square grids	2015-06-01	Paper
Locating and identifying codes in circulant networks	2014-04-22	Paper
https://portal.mardi4nfdi.de/entity/Q3115016	2012-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q3090476	2011-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q3088442	2011-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q3011738	2011-06-29	Paper
Domination in a digraph and in its reverse	2010-04-28	Paper
Histories in path graphs	2008-02-22	Paper
Histories in Path Graphs	2007-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q3428642	2007-03-29	Paper
https://portal.mardi4nfdi.de/entity/Q5478339	2006-07-13	Paper
Iterated line graphs are maximally ordered	2006-06-06	Paper
Linkability in iterated line graphs	2006-05-16	Paper
Connectivity of iterated line graphs	2003-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q4783810	2002-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q4529522	2002-05-22	Paper
Connectivity of path graphs	2002-03-24	Paper
Diameter in iterated path graphs	2001-07-02	Paper
https://portal.mardi4nfdi.de/entity/Q4944758	2000-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q4374712	1998-01-25	Paper
Radii and centers in iterated line digraphs	1997-02-25	Paper
https://portal.mardi4nfdi.de/entity/Q4838485	1995-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q5286018	1993-06-29	Paper
A refinement of Halin's end-faithful spanning tree theorem	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3315542	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3340901	1982-01-01	Paper
Elevation of a graph	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3855216	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3853667	1979-01-01	Paper

Research outcomes over time

This page was built for person: L'udovít Niepel