Yaojun Chen

Orcid: 0000-0002-4718-5677

According to our database1, Yaojun Chen authored at least 95 papers between 2001 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Maximum cliques in a graph without disjoint given subgraph.
Discret. Math., April, 2024

The maximum number of triangles in Fk-free graphs.
Eur. J. Comb., December, 2023

Isolated toughness and fractional (<i>a,b,n</i>)-critical graphs.
Connect. Sci., December, 2023

Turán number for odd-ballooning of trees.
J. Graph Theory, October, 2023

Connectedness of friends-and-strangers graphs of complete bipartite graphs and others.
Discret. Math., August, 2023

Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs.
Discret. Math., August, 2023

The Connectedness of the Friends-and-Strangers Graph of a Lollipop and Others.
Graphs Comb., June, 2023

Gallai-Ramsey number of odd cycles with chords.
Eur. J. Comb., 2023

Connectivity of friends-and-strangers graphs on random pairs.
Discret. Math., 2023

Multicolor bipartite Ramsey numbers for quadrilaterals and stars.
Appl. Math. Comput., 2023

Maximal Distance Spectrum Assignment for Services Provisioning in Elastic Optical Networks.
Proceedings of the IFIP Networking Conference, 2023

A Novel Anti-DC Bias Energy Meter Based on Magnetic-Valve-Type Current Transformer.
IEEE Trans. Instrum. Meas., 2022

Optimal oriented diameter of graphs with diameter 3.
J. Comb. Theory B, 2022

Viewing the network parameters and H -factors from the perspective of geometry.
Int. J. Intell. Syst., 2022

On the 3-Color Ramsey Numbers R(C<sub>4, C<sub>4, W<sub>n</sub>)</sub></sub>.
Graphs Comb., 2022

The Ramsey Number of 3-Uniform Loose Path Versus Star.
Graphs Comb., 2022

Bounds for two multicolor Ramsey numbers concerning quadrilaterals.
Finite Fields Their Appl., 2022

Generalized Turán number for linear forests.
Discret. Math., 2022

Gallai-Ramsey number of even cycles with chords.
Discret. Math., 2022

Degree sums and spanning brooms of a graph.
Discret. Math., 2022

Degree sums and proper connection number of graphs.
Discret. Appl. Math., 2022

Tight isolated toughness bound for fractional (k, n)-critical graphs.
Discret. Appl. Math., 2022

Oriented diameter of maximal outerplanar graphs.
J. Graph Theory, 2021

The Ramsey numbers of two sets of cycles.
J. Graph Theory, 2021

Tight bounds for the existence of path factors in network vulnerability parameter settings.
Int. J. Intell. Syst., 2021

Network vulnerability parameter and results on two surfaces.
Int. J. Intell. Syst., 2021

Generalized Turán Number of Even Linear Forests.
Graphs Comb., 2021

Star-Critical Ramsey Numbers of Cycles Versus Wheels.
Graphs Comb., 2021

Inverting the Turán problem with chromatic number.
Discret. Math., 2021

Degree sums and dominating cycles.
Discret. Math., 2021

Gallai-Ramsey numbers for multiple triangles.
Discret. Appl. Math., 2021

Gallai and ℓ-uniform Ramsey numbers of complete bipartite graphs.
Discret. Appl. Math., 2021

On Virtual Network Embedding: Paths and Cycles.
IEEE Trans. Netw. Serv. Manag., 2020

Planar graphs without 4- and 6-cycles are (7 : 2)-colorable.
J. Comb. Optim., 2020

Approximation analysis of ontology learning algorithm in linear combination setting.
J. Cloud Comput., 2020

Failure Mechanism Study of Direct Action Solenoid Valve Based on Thermal-Structure Finite Element Model.
IEEE Access, 2020

A Novel Hybrid Active Power Filter Based on Coupling Inductor.
Proceedings of the 46th Annual Conference of the IEEE Industrial Electronics Society, 2020

A High-efficiency Method for Linear Precision AC Voltage Regulation and Filtering.
Proceedings of the 46th Annual Conference of the IEEE Industrial Electronics Society, 2020

A Single Stage Multilevel Converter Based on Transformer Multi-tap Voltages Control Fed by Low DC Voltage Source.
Proceedings of the 46th Annual Conference of the IEEE Industrial Electronics Society, 2020

The Ramsey Numbers of Trees Versus Generalized Wheels.
Graphs Comb., 2019

Complete Graph-Tree Planar Ramsey Numbers.
Graphs Comb., 2019

On three-color Ramsey numbers <i>R</i>(<i>C</i><sub>4</sub>, <i>K</i><sub>1, <i>m</i></sub>, <i>P</i><sub><i>n</i></sub>).
Finite Fields Their Appl., 2019

On three color Ramsey numbers R(C4, C4, K1, n).
Discret. Math., 2019

Spectrum Management in Elastic Optical Networks: Perspectives of Topology, Traffic and Routing.
Proceedings of the 2019 IFIP Networking Conference, 2019

Failure and failure characterization of QFP package interconnect structure under random vibration condition.
Microelectron. Reliab., 2018

Ontology geometry distance computation using deep learning technology.
J. Intell. Fuzzy Syst., 2018

Embedding trees in graphs with independence number two.
Discret. Math. Algorithms Appl., 2018

How the Network Topology, Traffic Distribution, and Routing Scheme Impact on the Spectrum Usage in Elastic Optical Networks.
CoRR, 2018

On the extremal eccentric connectivity index of graphs.
Appl. Math. Comput., 2018

On the Distance Spectrum Assignment in Elastic Optical Networks.
IEEE/ACM Trans. Netw., 2017

Neighbor sum distinguishing index of 2-degenerate graphs.
J. Comb. Optim., 2017

All Quadrilateral-Wheel Planar Ramsey Numbers.
Graphs Comb., 2017

Some values of Ramsey numbers for C<sub>4</sub> versus stars.
Finite Fields Their Appl., 2017

Polarity graphs and Ramsey numbers for C<sub>4</sub> versus stars.
Discret. Math., 2017

The Maximum Size of C<sub>4</sub>-Free Planar Graphs.
Ars Comb., 2017

On fan-wheel and tree-wheel Ramsey numbers.
Discret. Math., 2016

On star-critical and upper size Ramsey numbers.
Discret. Appl. Math., 2016

All Complete Graph-Wheel Planar Ramsey Numbers.
Graphs Comb., 2015

Three Results on Cycle-Wheel Ramsey Numbers.
Graphs Comb., 2015

Ramsey numbers of trees versus fans.
Discret. Math., 2015

The difference between remoteness and radius of a graph.
Discret. Appl. Math., 2015

Neighbor sum distinguishing edge colorings of sparse graphs.
Discret. Appl. Math., 2015

The Ramsey numbers of fans versus a complete graph of order five.
Electron. J. Graph Theory Appl., 2014

A remark on star-C4 and wheel-C4 Ramsey numbers.
Electron. J. Graph Theory Appl., 2014

The Ramsey numbers of wheels versus odd cycles.
Discret. Math., 2014

The planar Ramsey number PR(C<sub>4</sub>, K<sub>8</sub>).
Discret. Appl. Math., 2014

An Immune-Algorithm-Based Space-Vector PWM Control Strategy in a Three-Phase Inverter.
IEEE Trans. Ind. Electron., 2013

A Note on Planar Ramsey Numbers for a Triangle Versus Wheels.
Discret. Math. Theor. Comput. Sci., 2012

A theorem on cycle-wheel Ramsey number.
Discret. Math., 2012

Intelligent Scheduling Algorithm and Application in Modernizing Manufacturing Services.
Proceedings of the IEEE International Conference on Services Computing, 2011

The Ramsey numbers for cycles versus wheels of even order.
Eur. J. Comb., 2010

The Ramsey numbers for Stars of odd Order versus a Wheel of Order nine.
Discret. Math. Algorithms Appl., 2009

Codiameters of 3-domination critical graphs with toughness more than one.
Discret. Math., 2009

The Ramsey number for a cycle of length six versus a clique of order eight.
Discret. Appl. Math., 2009

The Ramsey numbers for cycles versus wheels of odd order.
Appl. Math. Lett., 2009

The Ramsey numbers for stars of even order versus a wheel of order nine.
Eur. J. Comb., 2008

The Ramsey numbers R(C<sub>m</sub>, K<sub>7</sub>) and R(C<sub>7</sub>, K<sub>8</sub>).
Eur. J. Comb., 2008

Upper signed domination number.
Discret. Math., 2008

Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5.
Discret. Math., 2008

Acyclic Domination Number and Minimum Degree in 2-Diameter-Critical Graphs.
Ars Comb., 2008

Research on Shop Floor Management and Control System Based on Multiagent Systems and IPDI Principle.
Proceedings of the International Conference on Computer Science and Software Engineering, 2008

The Ramsey numbers for a cycle of length six or seven versus a clique of order seven.
Discret. Math., 2007

The Ramsey numbers of trees versus <i>W</i><sub>6</sub> or <i>W</i><sub>7</sub>.
Eur. J. Comb., 2006

A note on acyclic domination number in graphs of diameter two.
Discret. Appl. Math., 2006

A fan-type condition for cyclability.
Discret. Math., 2005

The Ramsey numbers of paths versus wheels.
Discret. Math., 2005

A note on domination and minus domination numbers in cubic graphs.
Appl. Math. Lett., 2005

The Ramsey numbers of stars versus wheels.
Eur. J. Comb., 2004

The Ramsey numbers R(T<sub>n</sub>, W<sub>6</sub>) for Delta (T<sub>n</sub>) geq n-3.
Appl. Math. Lett., 2004

Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta.
Discret. Math., 2003

A New Proof of Wojcicka's Conjecture.
Discret. Appl. Math., 2003

Codiameters of 3-connected 3-domination critical graphs.
J. Graph Theory, 2002

Hamilton-connectivity of 3-Domination Critical Graphs with alpha=delta + 2.
Eur. J. Comb., 2002

Degree Sums and Path-Factors in Graphs.
Graphs Comb., 2001

An Ore-type Condition for Cyclability.
Eur. J. Comb., 2001