N. Ananchuen

From MaRDI portal
Person:1415536

Available identifiers

zbMath Open ananchuen.nawaratMaRDI QIDQ1415536

List of research outcomes





PublicationDate of PublicationType
Traceability of connected domination critical graphs2021-03-16Paper
Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor2021-02-10Paper
Connected domination critical graphs with cut vertices2020-08-26Paper
A characterization of 3-i-critical graphs of connectivity two2019-10-15Paper
https://portal.mardi4nfdi.de/entity/Q31193262019-03-11Paper
On minimum cutsets in independent domination vertex critical graphs2019-01-30Paper
https://portal.mardi4nfdi.de/entity/Q31307122018-01-23Paper
Extendability of the complementary prism of bipartite graphs2017-11-17Paper
On independent domination critical graphs and \(k\)-factor critical.2016-10-26Paper
Extendability of the complementary prism of 2-regular graphs2016-10-14Paper
Critical graphs with respect to total domination and connected domination2016-09-14Paper
Extendability of the complementary prism of extendable graphs2016-07-14Paper
Some structures of \(3-({\gamma}_c, 2)\)-critical graphs which are not \(3-{\gamma}_c\)-critical2016-06-10Paper
A characterization of independent domination critical graphs with a cutvertex2016-05-30Paper
Some toughness results in independent domination critical graphs2015-11-17Paper
Connected domination: vertex criticality and matchings2013-07-12Paper
Maximal \(3\)-\(\gamma\)-vertex-critical graphs2012-12-29Paper
On local edge connected domination critical graphs2011-05-31Paper
On 4-\(\gamma_c\)-critical graphs with cut-vertices2011-05-31Paper
Domination in Graphs2010-12-21Paper
The structure of \(4-\gamma \)-critical graphs with a cut vertex2010-10-11Paper
A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical2010-10-07Paper
On domination critical graphs with cutvertices having connected domination number 32008-04-03Paper
Matching properties in connected domination critical graphs2008-02-11Paper
3-factor-criticality in domination critical graphs2007-11-30Paper
Matchings in 3-vertex-critical graphs: the odd case2007-05-11Paper
A characterization of maximal non-\(k\)-factor-critical graphs2007-02-02Paper
Some results related to the toughness of 3-domination critical graphs. II2006-12-12Paper
On the connectivity and matchings in 3-vertex-critical claw-free graphs2006-09-14Paper
Matchings in 3‐vertex‐critical graphs: The even case2005-08-05Paper
https://portal.mardi4nfdi.de/entity/Q44605542004-05-18Paper
Matching properties in domination critical graphs.2004-03-14Paper
Some results related to the toughness of 3-domination critical graphs2003-12-04Paper
Factor criticality and complete closure of graphs2003-05-25Paper
On strongly \(k\)-extendable graphs2002-04-21Paper
On minimum degree of strongly \(k\)-extendable graphs2002-04-21Paper
Matching extension and minimum degree1997-11-10Paper
https://portal.mardi4nfdi.de/entity/Q48745891996-08-22Paper
https://portal.mardi4nfdi.de/entity/Q48581441996-02-06Paper

Research outcomes over time

This page was built for person: N. Ananchuen