Yaping Mao

Ingo Schiermeyer

Discuss. Math. Graph Theory, 2026

Bip-ordered bipartite Ramsey number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2026

Ramsey minimal graphs for small paths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2026

Ordered Ramsey numbers for the union of graphs.

[BibT_eX]

[DOI]

Gemaji Bao

Discret. Appl. Math., 2026

2025

Approximation algorithms for the total dominating set problem.

[BibT_eX]

[DOI]

J. Comb. Optim., July, 2025

The g-good-neighbor diagnosability of product networks under the PMC model.

[BibT_eX]

[DOI]

CoRR, March, 2025

Fault-tolerance in distance-edge-monitoring sets.

[BibT_eX]

[DOI]

Acta Informatica, March, 2025

Conditional Fractional Matching Preclusion Number of Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., February, 2025

Monitoring the edges of product networks using distances.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2025

The g-good-neighbor diagnosability of product networks under the PMC model.

[BibT_eX]

[DOI]

Inf. Comput., 2025

Linear programming of monitoring the links of a fractional weighted network using distance.

[BibT_eX]

[DOI]

Wen Li

Ralf Klasing

Inf. Comput., 2025

Constructing disjoint Steiner trees in Sierpiński graphs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2025

Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2025

Ramsey and Gallai-Ramsey numbers for forests.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2025

Ramsey and Gallai-Ramsey numbers for multiple triangles of graphs and their multiplicities.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

Ramsey and Gallai-Ramsey numbers for comb and sun graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

Multicolor induced Ramsey numbers.

[BibT_eX]

[DOI]

Yanyan Song

Discret. Appl. Math., 2025

Ordered Gallai-Ramsey numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

The distance-edge-monitoring numbers of subdivision graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

2024

Gallai-Ramsey Numbers for Paths.

[BibT_eX]

[DOI]

Graphs Comb., December, 2024

Distance-edge-monitoring sets of networks.

[BibT_eX]

[DOI]

Acta Informatica, June, 2024

Gallai-Ramsey Multiplicity.

[BibT_eX]

[DOI]

Graphs Comb., May, 2024

A Commentary on the Progress of Big Data in Combinatorial Optimization.

[BibT_eX]

[DOI]

Parallel Process. Lett., March, 2024

Online Single-Processor Scheduling with an Unexpected Breakdown.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., February, 2024

On the distance-edge-monitoring numbers of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., January, 2024

Erdös-Gallai-type problems for distance-edge-monitoring numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., January, 2024

Realizability problem of distance-edge-monitoring numbers.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2024

Monitoring the edges of a graph using distances with given girth.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2024

The g-extra connectivity of graph products.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2024

The number of spanning trees for Sierpiński graphs and data center networks.

[BibT_eX]

[DOI]

Inf. Comput., 2024

Perturbation Results for Distance-edge-monitoring Numbers.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2024

Complete bipartite graphs without small rainbow subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

A Distributed Approximation Algorithm for the Total Dominating Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

Size Gallai-Ramsey Number.

[BibT_eX]

[DOI]

Graphs Comb., December, 2023

Complete bipartite graphs without small rainbow stars.

[BibT_eX]

[DOI]

Discret. Appl. Math., December, 2023

A distributed message passing algorithm for computing perfect demand matching.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., September, 2023

Gallai-Ramsey Numbers Involving a Rainbow 4-Path.

[BibT_eX]

[DOI]

Graphs Comb., June, 2023

Gallai-Ramsey numbers for fans.

[BibT_eX]

[DOI]

Discret. Math., May, 2023

Edge-Disjoint Steiner Trees and Connectors in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., April, 2023

Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2023

Ramsey and Gallai-Ramsey numbers for the union of paths and stars.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

Streaming Algorithms for the k-Submodular Cover Problem.

[BibT_eX]

[DOI]

CoRR, 2023

2022

On relations between Sombor and other degree-based indices.

[BibT_eX]

[DOI]

J. Appl. Math. Comput., February, 2022

A general approach to deriving diagnosability results of interconnection networks.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2022

A note on maximum fractional matchings of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Steiner 3-diameter, maximum degree and size of a graph.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2022

Ramsey and Gallai-Ramsey Number for Wheels.

[BibT_eX]

[DOI]

Graphs Comb., 2022

Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels.

[BibT_eX]

[DOI]

Discret. Math., 2022

Fractional matching preclusion number of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

On the distance-edge-monitoring numbers of graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Multi-type feature fusion based on graph neural network for drug-drug interaction prediction.

[BibT_eX]

[DOI]

BMC Bioinform., 2022

2021

Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2021

Preface.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2021

Strong Equitable Vertex Arboricity in Cartesian Product Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2021

Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

Steiner diameter, maximum degree and size of a graph.

[BibT_eX]

[DOI]

Peter Dankelmann

Zhao Wang

Discret. Math., 2021

2020

On the g-good-neighbor connectivity of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Note on matching preclusion number of random graphs.

[BibT_eX]

[DOI]

Ran Gu

Guoju Ye

Theor. Comput. Sci., 2020

Nordhaus-Gaddum-Type Results for the Steiner Gutman Index of Graphs.

[BibT_eX]

[DOI]

Symmetry, 2020

A note on the strong matching preclusion problem for data center networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

On Cycles that Alternate Through Selected Sets of Vertices.

[BibT_eX]

[DOI]

Colton Magnant

Graphs Comb., 2020

Conflict-free vertex-connections of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

Ramsey and Gallai-Ramsey numbers for stars with extra independent edges.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Invulnerability of planar two-tree networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Matching preclusion number of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Matching preclusion number in product graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

A Concise Survey of Matching Preclusion in Interconnection Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2019

Preface.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2019

Steiner Distance in Join, Corona, Cluster, and Threshold Graphs.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2019

Fractional matching preclusion for generalized augmented cubes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

Gallai-Ramsey numbers for books.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Fractional matching preclusion for arrangement graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

On conflict-free connection of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Strong matching preclusion number of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Fractional Matching Preclusion for (n, k)-Star Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2018

On the Steiner 4-Diameter of Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2018

A note on the Steiner -diameter of a graph.

[BibT_eX]

[DOI]

Christopher Melekian

Int. J. Comput. Math. Comput. Syst. Theory, 2018

Steiner Distance in Product Networks.

[BibT_eX]

[DOI]

Zhao Wang

Discret. Math. Theor. Comput. Sci., 2018

Inverse problem on the Steiner Wiener index.

[BibT_eX]

[DOI]

Ivan Gutman

Discuss. Math. Graph Theory, 2018

Constructing internally disjoint pendant Steiner trees in Cartesian product networks.

[BibT_eX]

[DOI]

Australas. J Comb., 2018

The k-independence number of graph products.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2018

Fractional Matching Preclusion for (Burnt) Pancake Graphs.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Pervasive Systems, 2018

2017

Super Edge-Connectivity of Strong Product Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2017

A solution to a conjecture on the generalized connectivity of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Trees with large numbers of subtrees.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2017

Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

The chromatic equivalence class of graph ψn3(n-3, 1).

[BibT_eX]

Ars Comb., 2017

Constructing edge-disjoint Steiner paths in lexicographic product networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

Steiner Distance in Join, Corona and Threshold Graphs.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Pervasive Systems, 2017

Conflict-Free Connection Numbers of Line Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Linear k-Arboricity in Product Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2016

Rainbow vertex-connection and graph products.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2016

Path-connectivity of lexicographic product graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2016

The vertex-rainbow index of a graph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

Graphs with large generalized (edge-)connectivity.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

The Steiner Wiener index of a graph.

[BibT_eX]

[DOI]

Ivan Gutman

Discuss. Math. Graph Theory, 2016

Monochromatic connectivity and graph products.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2016

The fifth coefficient of adjoint polynomial and a new invariant.

[BibT_eX]

Chengfu Ye

Ars Comb., 2016

2015

On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices.

[BibT_eX]

[DOI]

Graphs Comb., 2015

The complexity of determining the vertex-rainbow index of graphs.

[BibT_eX]

[DOI]

Yongtang Shi

Discret. Math. Algorithms Appl., 2015

On the equitable vertex arboricity of complete tripartite graphs.

[BibT_eX]

[DOI]

Zhiwei Guo

Haixing Zhao

Discret. Math. Algorithms Appl., 2015

Note on the spanning-tree packing number of lexicographic product graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

The minimal size of a graph with given generalized 3-edge-connectivity.

[BibT_eX]

Ars Comb., 2015

Searching for (near) Optimal Codes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

The generalized 3-connectivity of Lexicographic product graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Additive codes over $GF(4)$ from circulant graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Formally self-dual linear binary codes from circulant graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Note on the generalized connectivity.

[BibT_eX]

Ars Comb., 2014

On the generalized (edge-)connectivity of graphs.

[BibT_eX]

[DOI]

Yuefang Sun

Australas. J Comb., 2014

2012

A survey on the generalized connectivity of graphs

[BibT_eX]

[DOI]