Mihai Talmaciu

Available identifiers

zbMath Open talmaciu.mihaiMaRDI QIDQ2573395

List of research outcomes

Publication	Date of Publication	Type
On hyper-chordal graphs	2021-12-15	Paper
https://portal.mardi4nfdi.de/entity/Q5231932	2019-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q5231949	2019-09-04	Paper
On bicliques, biclique partitions and related classes of cographs	2018-05-22	Paper
Generalizations of triangulated graphs	2018-05-22	Paper
Recognition algorithm for \(P_4\)-tidy graphs	2018-05-22	Paper
Fast algorithms of hereditary doubly chordal graphs	2018-05-22	Paper
Recognition and combinatorial optimization algorithms for bipartite chain graphs	2018-04-05	Paper
Hardly perfect graphs	2016-09-02	Paper
Fast algorithms of dually chordal graphs	2016-03-17	Paper
Optimization problems on threshold graphs	2015-12-14	Paper
https://portal.mardi4nfdi.de/entity/Q2941364	2015-08-27	Paper
On {claw, antenna, net}-free graphs	2015-01-08	Paper
Verification of the normal graph conjecture on particular classes of graphs	2014-10-14	Paper
Investigations on the bisection problem	2014-10-14	Paper
Sequential \(NP_5, IP_5, MP_5\) graphs	2012-12-19	Paper
Optimization problems on quasi-threshold graphs	2012-06-21	Paper
The normal graph conjecture is true for minimal unbreakable graphs	2011-08-31	Paper
On partitionable, confidentially connected and unbreakable graphs	2011-06-23	Paper
Recognition algorithm for diamond-free graphs	2010-10-29	Paper
https://portal.mardi4nfdi.de/entity/Q3642616	2009-11-05	Paper
Visibility properties and forbidden holes in graphs	2008-04-14	Paper
On a \(k\)-clique-join of a class of partitionalble graphs	2005-11-21	Paper
https://portal.mardi4nfdi.de/entity/Q5705841	2005-11-09	Paper
https://portal.mardi4nfdi.de/entity/Q5705706	2005-11-09	Paper
https://portal.mardi4nfdi.de/entity/Q4550483	2002-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q4391269	1998-10-26	Paper

Research outcomes over time

This page was built for person: Mihai Talmaciu