You Lu

From MaRDI portal
Person:263023

Available identifiers

zbMath Open lu.youMaRDI QIDQ263023

List of research outcomes





PublicationDate of PublicationType
Six-flows of signed graphs with frustration index three2024-12-02Paper
Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 102024-01-16Paper
Signed circuit $6$-covers of signed $K_4$-minor-free graphs2023-10-25Paper
Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable2023-05-31Paper
On the second smallest and the largest normalized Laplacian eigenvalues of a graph2021-08-17Paper
Flows on flow-admissible signed graphs2021-06-18Paper
Edge DP-coloring in planar graphs2021-03-25Paper
Neighbor sum distinguishing total choice number of planar graphs without 6-cycles2021-02-24Paper
Neighbor sum distinguishing total choosability of cubic graphs2021-02-16Paper
Flows on Signed Graphs without Long Barbells2020-10-27Paper
Edge coloring of signed graphs2020-06-05Paper
https://portal.mardi4nfdi.de/entity/Q51938682019-09-20Paper
Shortest circuit covers of signed graphs2018-12-20Paper
Neighbor sum distinguishing total coloring of graphs with bounded treewidth2018-07-26Paper
Signed Graphs: From Modulo Flows to Integer-Valued Flows2018-04-27Paper
Neighbor sum distinguishing list total coloring of subcubic graphs2018-04-13Paper
Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring2018-02-22Paper
Multiple weak 2-linkage and its applications on integer flows of signed graphs2017-12-21Paper
Adjacent vertex distinguishing total coloring of graphs with maximum degree 42016-12-14Paper
Trees with 2-reinforcement number three2016-04-04Paper
Notes on ``Bipolar fuzzy graphs2015-09-23Paper
On the \(p\)-reinforcement and the complexity2015-02-16Paper
The p-domination number of complete multipartite graphs2014-11-28Paper
Trees with maximum \(p\)-reinforcement number2014-08-26Paper
Covering digraphs with small indegrees or outdegrees by directed cuts2014-01-22Paper
The total bondage number of grid graphs2012-10-19Paper
Trees with unique minimum \(p\)-dominating sets2012-07-02Paper
The 2-Domination and 2-Bondage Numbers of Grid Graphs2012-04-19Paper
The \(p\)-bondage number of trees2012-01-24Paper
https://portal.mardi4nfdi.de/entity/Q31055552012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q30041472011-05-31Paper
A characterization of (γt2)-trees2011-05-09Paper
On the \((2,2)\)-domination number of trees2010-12-08Paper
Bipanconnectivity of Cartesian product networks2010-06-07Paper
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs2010-04-28Paper
A note on the p-domination number of trees2009-10-26Paper
On the \(\{k\}\)-domination number of Cartesian products of graphs2009-06-23Paper
A spline method for solving two-dimensional Fredholm integral equation of second kind with the hypersingular kernel2001-07-23Paper
https://portal.mardi4nfdi.de/entity/Q45283412001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q49375702000-04-09Paper
https://portal.mardi4nfdi.de/entity/Q42256641999-09-09Paper

Research outcomes over time

This page was built for person: You Lu