N. Punnim

From MaRDI portal
Person:554847

Available identifiers

zbMath Open punnim.narongMaRDI QIDQ554847

List of research outcomes





PublicationDate of PublicationType
GDDs with two associate classes and with three groups of sizes \(1,n\) and \(n\)2014-08-15Paper
On Non 3-Choosable Bipartite Graphs2013-12-06Paper
GDDs with Two Associate Classes and with Three Groups of Sizes 1, n, n and λ 1 < λ 22013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q49148832013-04-15Paper
The forest number in several classes of regular graphs2013-04-03Paper
The positivity problem for fourth order linear recurrence sequences is decidable2012-10-29Paper
https://portal.mardi4nfdi.de/entity/Q31659992012-10-21Paper
Group divisible designs with two associate classes and \((\lambda_1,\lambda_2)=(1,2)\)2012-10-21Paper
On \((k,t)\)-choosability of graphs.2012-10-08Paper
Regular graphs with maximum forest number2011-11-11Paper
Group divisible designs with two associate classes and \(\lambda_{2}=1\)2011-09-09Paper
Loop designs2011-08-24Paper
An intermediate value theorem for the arboricities2011-07-22Paper
The Hamiltonian number of some classes of cubic graphs2011-07-13Paper
The Hamiltonian number of graphs with prescribed connectivity2011-02-11Paper
Gregarious GDDs with two associate classes2010-12-03Paper
Forest in biquartic graphs2009-05-22Paper
https://portal.mardi4nfdi.de/entity/Q36262062009-05-22Paper
The Hamiltonian Number of Cubic Graphs2009-01-13Paper
The Forest Number of (n,m)-Graphs2009-01-13Paper
The decycling number of regular graphs2008-11-20Paper
https://portal.mardi4nfdi.de/entity/Q54425272008-02-22Paper
A construction for group divisible designs with two groups2008-02-20Paper
A \(3\)-\((v,4,1)\) packing construction2007-11-06Paper
Constrained switchings in cubic graphs.2007-09-21Paper
The Decycling Number of Cubic Planar Graphs2007-08-28Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Decycling connected regular graphs2006-08-03Paper
Switchings, realizations, and interpolation theorems for graph parameters2005-12-07Paper
Graph of realizations and chromatic numbers2005-10-18Paper
https://portal.mardi4nfdi.de/entity/Q53132922005-08-29Paper
https://portal.mardi4nfdi.de/entity/Q30252092005-07-13Paper
https://portal.mardi4nfdi.de/entity/Q46679112005-04-18Paper
https://portal.mardi4nfdi.de/entity/Q46693722005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46614862005-04-04Paper
Interpolation theorems on graph parameters2005-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48249392004-11-01Paper
Forests in random graphs2004-09-22Paper
On maximum induced forests in graphs2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44383332004-03-02Paper
The clique numbers of regular graphs2003-03-27Paper
Degree sequences and chromatic numbers of graphs2003-03-25Paper
On \(F(j)\)-graphs and their applications2002-01-21Paper
On the cyclic decomposition of complete graphs into bipartite graphs2002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q47246681987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39553931982-01-01Paper

Research outcomes over time

This page was built for person: N. Punnim