Xiang'en Chen

From MaRDI portal
Person:458135

Available identifiers

zbMath Open chen.xiangenMaRDI QIDQ458135

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61624542023-06-15Paper
https://portal.mardi4nfdi.de/entity/Q50990512022-08-31Paper
https://portal.mardi4nfdi.de/entity/Q50331382022-02-22Paper
https://portal.mardi4nfdi.de/entity/Q50171472021-12-17Paper
https://portal.mardi4nfdi.de/entity/Q50170332021-12-17Paper
https://portal.mardi4nfdi.de/entity/Q33807432021-09-29Paper
https://portal.mardi4nfdi.de/entity/Q33812292021-09-29Paper
https://portal.mardi4nfdi.de/entity/Q33814322021-09-29Paper
https://portal.mardi4nfdi.de/entity/Q49958502021-07-01Paper
https://portal.mardi4nfdi.de/entity/Q49961192021-07-01Paper
完全二部图K9, n (93 ≤ n ≤ 216)的点可区别E-全染色2021-04-26Paper
https://portal.mardi4nfdi.de/entity/Q58588702021-04-14Paper
https://portal.mardi4nfdi.de/entity/Q33859132021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q51436952021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q33857502021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q33857602021-01-14Paper
完全二部图 K 10, n (215 ≤ n ≤ 466)的点可区别E-全染色2020-10-27Paper
https://portal.mardi4nfdi.de/entity/Q51277582020-10-27Paper
https://portal.mardi4nfdi.de/entity/Q51275622020-10-27Paper
https://portal.mardi4nfdi.de/entity/Q33078452020-08-12Paper
https://portal.mardi4nfdi.de/entity/Q33062692020-08-12Paper
https://portal.mardi4nfdi.de/entity/Q33075422020-08-12Paper
https://portal.mardi4nfdi.de/entity/Q33076722020-08-12Paper
https://portal.mardi4nfdi.de/entity/Q33077062020-08-12Paper
https://portal.mardi4nfdi.de/entity/Q51152032020-08-12Paper
https://portal.mardi4nfdi.de/entity/Q32971552020-07-02Paper
https://portal.mardi4nfdi.de/entity/Q52096162020-01-22Paper
The neighbor expanded sum distinguishing total colorings of three types of join graphs of wheel and fan2020-01-22Paper
https://portal.mardi4nfdi.de/entity/Q52064142019-12-18Paper
https://portal.mardi4nfdi.de/entity/Q51967002019-09-20Paper
完全二部图K10,n(10≤n≤90)的点可区别E-全染色2019-09-20Paper
https://portal.mardi4nfdi.de/entity/Q51943512019-09-20Paper
https://portal.mardi4nfdi.de/entity/Q53836242019-06-21Paper
https://portal.mardi4nfdi.de/entity/Q53816602019-06-21Paper
K1,3,p和 K1,4,p的点可区别的IE-全染色及一般全染色2019-06-21Paper
https://portal.mardi4nfdi.de/entity/Q53821922019-06-21Paper
https://portal.mardi4nfdi.de/entity/Q46238192019-02-22Paper
https://portal.mardi4nfdi.de/entity/Q46884132018-10-22Paper
https://portal.mardi4nfdi.de/entity/Q46877362018-10-22Paper
https://portal.mardi4nfdi.de/entity/Q31754062018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q31758202018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q45748362018-07-18Paper
$r$-strongly vertex-distinguishing total coloring of graphs2018-06-25Paper
https://portal.mardi4nfdi.de/entity/Q31343572018-02-09Paper
https://portal.mardi4nfdi.de/entity/Q31314332018-01-29Paper
https://portal.mardi4nfdi.de/entity/Q31316862018-01-29Paper
https://portal.mardi4nfdi.de/entity/Q31319382018-01-29Paper
完全二部图K_(2,n)和K_(3,n)的一般点可区别全染色2017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52765282017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52772742017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q29843462017-05-17Paper
当24≤d≤34时圈的d-强全染色2017-05-17Paper
Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph2017-02-08Paper
https://portal.mardi4nfdi.de/entity/Q31800632017-01-06Paper
https://portal.mardi4nfdi.de/entity/Q31803442017-01-06Paper
Total vertex irregularity strength of certain equitable complete \(m\)-partite graphs.2016-10-26Paper
Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{3,n}\) with \(n\geq 18\)2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29905372016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q29926602016-08-10Paper
完全二部图K3,n(3≤n≤17)的点可区别E-全染色2016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q34611882016-01-15Paper
Probing Graph Proper Total Colorings With Additional Constrained Conditions2015-12-28Paper
https://portal.mardi4nfdi.de/entity/Q31939252015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31933922015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31934122015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31942842015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q51737182015-02-16Paper
https://portal.mardi4nfdi.de/entity/Q54978462015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q54975242015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q54981212015-02-11Paper
Point-distinguishing chromatic index of the union of paths2015-01-27Paper
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)2014-12-09Paper
Adjacent vertex distinguishing total colorings of graphs with smaller degrees2014-11-03Paper
Vertex-distinguishing proper edge coloring of composition of complete graph and star2014-11-03Paper
Some explorations on the vertex-distinguishing proper edge-coloring of compositional graphs \(K_p[P_q]\)2014-11-03Paper
Strongly gracefulness of natural number sequence lobster and its series tree2014-11-03Paper
An algorithm for general adjacent vertex-distinguishing total colorings of some graphs and its realization in MATLAB2014-11-03Paper
On the distinguishing proper edge colorings of several classes of complete 4-partite graphs2014-11-03Paper
Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_4\vee K_n\)2014-11-03Paper
Vertex-distinguishing E-total colorings of graphs2014-10-07Paper
Erratum to: ``Vertex-distinguishing E-total colorings of graphs2014-10-07Paper
https://portal.mardi4nfdi.de/entity/Q49809932014-06-30Paper
On the vertex-distinguishing proper edge coloring of composition of complete graph and star2014-04-15Paper
https://portal.mardi4nfdi.de/entity/Q54010682014-03-12Paper
https://portal.mardi4nfdi.de/entity/Q54010742014-03-12Paper
On equitable vertex distinguishing edge colorings of trees2014-02-28Paper
https://portal.mardi4nfdi.de/entity/Q53999732014-02-28Paper
https://portal.mardi4nfdi.de/entity/Q53990162014-02-28Paper
https://portal.mardi4nfdi.de/entity/Q53994482014-02-28Paper
Not necessarily proper total colourings which are adjacent vertex distinguishing2014-01-29Paper
A new problem on integer sets without 3AP2013-11-19Paper
Vertex strongly distinguishing total colorings of complete bipartite graphs \(K_{1,n},\;K_{2,n}\) and \(K_{3,n}\)2013-11-19Paper
An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs2013-11-19Paper
The digraceful of \(\overrightarrow{P_n}\) and \(\overrightarrow{C_n}\)2013-11-19Paper
On the vertex-distinguishing proper edge-coloring of \(K_{3,4}\vee K_t\)2013-11-19Paper
Discussion of odd-graceful trees conjecture2013-11-19Paper
On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs2013-11-19Paper
Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\))2013-11-11Paper
Generalized lexicographic product of graphs and strong endomorphism monoid2013-09-11Paper
https://portal.mardi4nfdi.de/entity/Q49277832013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49248942013-06-10Paper
Every lobster is odd-elegant2013-03-21Paper
https://portal.mardi4nfdi.de/entity/Q49009782013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49010292013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49007042013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49009772013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49012712013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49015042013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q48974632012-12-19Paper
The Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_3\vee K_n\)2012-10-05Paper
Chromatic uniqueness of a kind of complete tripartite graph2012-06-01Paper
Adjacent-vertex-distinguishing total coloring of planar bipartite graphs2012-06-01Paper
Vertex-distinguishing proper edge-coloring chromatic numbers of the composition of two graphs2012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q31089182012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31092512012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31703972011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30143752011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30171692011-07-19Paper
2-distance coloring of strong product of graphs2011-02-05Paper
Vertex-distinguishing total coloring of graphs2011-02-02Paper
On graceful generalized spiders and caterpillars.2011-02-02Paper
Vertex-distinguishing VE-total colorings of wheels, fans and complete bipartite graphs \(K_{1,n}\) and \(K_{2,n}\)2010-11-05Paper
Vertex distinguishing IE-total chromatic numbers of complete bipartite graph \(K_{5,n}\)2010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35718602010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q34036352010-02-12Paper
Adjacent strong edge colorings and total colorings of regular graphs2009-12-02Paper
A note on adjacent-vertex-distinguishing total chromatic numbers for \(P_m\times P_n, P_m\times C_n\) and \(C_m\times C_n\)2009-11-11Paper
The strong edge-coloring of Halin graphs with \(\Delta\geq 4\)2009-07-22Paper
Adjacent vertex distinguishing total coloring of Cartesian product of graphs2009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q53204412009-07-22Paper
The 2-distance chromatic number of Cartesian product of graphs2009-03-06Paper
The general neighbor-distinguishing chromatic index of graphs2009-03-06Paper
Star chromatic numbers of a family of planar graphs2009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36106172009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36105812009-03-06Paper
On the adjacent-vertex-distinguishing total chromatic number of \(rK_2 \vee K_s\)2008-11-24Paper
On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)2008-07-11Paper
On the adjacent-vertex-strongly-distinguishing total coloring of graphs2008-06-25Paper
AVDTC numbers of generalized Halin graphs with maximum degree at least 62008-05-26Paper
https://portal.mardi4nfdi.de/entity/Q35911962007-09-10Paper
https://portal.mardi4nfdi.de/entity/Q52958902007-07-31Paper
https://portal.mardi4nfdi.de/entity/Q52949762007-07-26Paper
https://portal.mardi4nfdi.de/entity/Q34367342007-05-11Paper
\(D(\beta)\)-vertex-distinguishing total coloring of graphs2007-02-16Paper
Adjacent-vertex-distinguishing total chromatic number of \(P_m\times K_n\)2007-01-29Paper
A lower bound on cochromatic number for line graphs of a kind of graphs2006-12-05Paper
A note on adjacent strong edge coloring of \(K(n,m)\)2006-10-24Paper
https://portal.mardi4nfdi.de/entity/Q54898882006-10-04Paper
https://portal.mardi4nfdi.de/entity/Q54830832006-08-16Paper
https://portal.mardi4nfdi.de/entity/Q54751712006-06-16Paper
https://portal.mardi4nfdi.de/entity/Q54698512006-05-26Paper
https://portal.mardi4nfdi.de/entity/Q54681612006-05-24Paper
https://portal.mardi4nfdi.de/entity/Q33747362006-03-09Paper
https://portal.mardi4nfdi.de/entity/Q33747382006-03-09Paper
https://portal.mardi4nfdi.de/entity/Q33747372006-03-09Paper
Adjacent-vertex-distinguishing total chromatic numbers on Mycielski's graphs on several kinds of particular graphs2006-03-01Paper
https://portal.mardi4nfdi.de/entity/Q33668312006-02-16Paper
On adjacent-vertex-distinguishing total coloring of graphs2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q30249482005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q30246792005-07-01Paper
https://portal.mardi4nfdi.de/entity/Q46698622005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46561942005-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48176292004-09-15Paper
https://portal.mardi4nfdi.de/entity/Q48093272004-08-24Paper
On the largest eigenvalues of trees2004-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44535592004-03-07Paper
Regularity of the generalized join of two graphs2002-01-14Paper
Further discussions on \(q\)-graphs.2001-06-20Paper
Chromaticity of the graph \(\theta(a,b,c,d,e)\)2001-06-20Paper
https://portal.mardi4nfdi.de/entity/Q45279512001-06-05Paper
https://portal.mardi4nfdi.de/entity/Q45260582001-01-25Paper
https://portal.mardi4nfdi.de/entity/Q43846231998-08-04Paper
Chromatic classes of certain 2-connected \((n,n+2)\)-graphs homeomorphic to \(K_ 4\)1998-02-16Paper
Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II1998-02-16Paper
https://portal.mardi4nfdi.de/entity/Q48549251996-02-12Paper

Research outcomes over time

This page was built for person: Xiang'en Chen