Jianguo Qian

Orcid: 0000-0001-6399-1452

According to our database1, Jianguo Qian authored at least 54 papers between 1987 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The sparse sequences of graphs.
Graphs Comb., December, 2024

The list-coloring function of signed graphs.
Discret. Math., March, 2024

Degree sum condition for vertex-disjoint 5-cycles.
Discuss. Math. Graph Theory, 2024

Minimum number of maximal dissociation sets in trees.
Discret. Appl. Math., 2024

Menger-Type Connectivity of Line Graphs of Generalized Hypercubes With Faulty Edges.
Comput. J., 2024

Cloud Detection Method Based on Improved DeeplabV3+ Remote Sensing Image.
IEEE Access, 2024

Improving Substation Network Security with DevSecOps and AIOps.
Proceedings of the 10th IEEE Conference on Big Data Security on Cloud, 2024

2023
Flips on homologous orientations of surface graphs with prescribed forbidden facial cycles.
Appl. Math. Comput., May, 2023

Research on Arc Sag Measurement Methods for Transmission Lines Based on Deep Learning and Photogrammetry Technology.
Remote. Sens., 2023

Dependency-Aware Core Column Discovery for Table Understanding.
Proceedings of the Semantic Web - ISWC 2023, 2023

2022
On Non-Empty Cross-Intersecting Families.
Comb., December, 2022

Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators.
SIAM J. Discret. Math., June, 2022

Automatic Extraction of Power Lines from Aerial Images of Unmanned Aerial Vehicles.
Sensors, 2022

Ramsey Numbers for Complete Graphs Versus Generalized Fans.
Graphs Comb., 2022

The Maximum Number of Stars in a Graph Without Linear Forest.
Graphs Comb., 2022

The odd-valued chromatic polynomial of a signed graph.
Discret. Math., 2022

Maximum Size of a Graph with Given Fractional Matching Number.
Electron. J. Comb., 2022

2021
Rainbow vertex-pancyclicity of strongly edge-colored graphs.
Discret. Math., 2021

A Novel Deception Defense-Based Honeypot System for Power Grid Network.
Proceedings of the Smart Computing and Communication - 6th International Conference, 2021

2020
Colorings versus list colorings of uniform hypergraphs.
J. Graph Theory, 2020

An Ore-type condition for the existence of two disjoint cycles.
Inf. Process. Lett., 2020

A generalization of Noel-Reed-Wu Theorem to signed graphs.
Discret. Math., 2020

Generalized Spectral Characterization of Mixed Graphs.
Electron. J. Comb., 2020

2019
Inclusion-exclusion by ordering-free cancellation.
J. Comb. Theory A, 2019

Alon-Tarsi Number and Modulo Alon-Tarsi Number of Signed Graphs.
Graphs Comb., 2019

Flow polynomials of a Signed Graph.
Electron. J. Comb., 2019

Chromatic-Choosability of Hypergraphs with High Chromatic Number.
Electron. J. Comb., 2019

Coattention-Based Recurrent Neural Networks for Sentiment Analysis of Chinese Texts.
Proceedings of the Smart Computing and Communication - 4th International Conference, 2019

2018
Bounds on the domination number of a digraph.
J. Comb. Optim., 2018

2017
When does the list-coloring function of a graph equal its chromatic polynomial.
J. Comb. Theory B, 2017

Simplification on Dynamic Range of a Generalized Chinese Remainder Theorem for Multiple Integers.
Integers, 2017

Towards a Version of Ohba's Conjecture for Improper Colorings.
Graphs Comb., 2017

2016
Erratum to: L(p, q)-labeling and integer tension of a graph embedded on torus.
J. Comb. Optim., 2016

L(p, q)-labeling and integer tension of a graph embedded on torus.
J. Comb. Optim., 2016

On the Rainbow Domination Number of Digraphs.
Graphs Comb., 2016

2015
On the sum of out-domination number and in-domination number of digraphs.
Ars Comb., 2015

2014
Enumeration of unlabeled uniform hypergraphs.
Discret. Math., 2014

2013
First Demonstration of Multiplexed X-Ray Fluorescence Computed Tomography (XFCT) Imaging.
IEEE Trans. Medical Imaging, 2013

Laplacian Spectral Radius and Maximum Degree of Trees with Perfect Matchings.
Graphs Comb., 2013

Enumeration of Unlabeled Directed Hypergraphs.
Electron. J. Comb., 2013

<i>L</i>(<i>p</i>, <i>q</i>)-Labeling and Integer Flow on Planar Graphs.
Comput. J., 2013

2010
Counting the cyclocized polyphenacenes.
J. Comput. Chem., 2010

2009
On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes.
Inf. Process. Lett., 2009

A generalization of Sperner's theorem and an application to graph orientations.
Discret. Appl. Math., 2009

Conjugated trees with minimum general Randic index.
Discret. Appl. Math., 2009

2008
Multi-hop all-to-all optical routings in Cartesian product networks.
Inf. Process. Lett., 2008

2007
On the dependence polynomial of a graph.
Eur. J. Comb., 2007

2006
Induced Matching Extendable Graph Powers.
Graphs Comb., 2006

Graph colourings and solutions of systems of equations over finite fields.
Discret. Math., 2006

Degree complete graphs.
Discret. Math., 2006

2004
Expanding and forwarding parameters of product graphs.
Discret. Appl. Math., 2004

1999
On the upper bound of the diameter of interchange graphs.
Discret. Math., 1999

Two classes of extreme graphs related to the maximum degree of an interchange graph.
Australas. J Comb., 1999

1987
Efficient point-to-point and point-to-multipoint selective-repeat ARQ schemes with multiple retransmissions: a throughput analysis.
Comput. Commun. Rev., 1987


  Loading...