Jianfeng Hou

According to our database, Jianfeng Hou authored at least 83 papers between 2006 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Many Vertex-Disjoint Even Cycles of Fixed Length in a Graph.

Jianfeng Hou, Caiyun Hu, Heng Li, Xizhi Liu, Caihong Yang, Yixiao Zhang

J. Graph Theory, March, 2026

An Andrásfai-Erdős-Sós type theorem for F3,3 in the ℓ2-norm.

Yixiao Zhang, Jianfeng Hou

Discret. Math., 2026

2025

On Min-Bisections of Graphs.

Jianfeng Hou, Shufei Wu

J. Graph Theory, 2025

Two Stability Theorems for Kℓ+1r-Saturated Hypergraphs.

Jianfeng Hou, Heng Li, Caihong Yang, Qinghou Zeng, Yixiao Zhang

J. Graph Theory, 2025

Tight Bounds for Rainbow Partial F-Tiling in Edge-Colored Complete Hypergraphs.

Jinghua Deng, Jianfeng Hou, Xizhi Liu, Caihong Yang

J. Graph Theory, 2025

Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs.

Jianfeng Hou, Caiyun Hu, Heng Li, Xizhi Liu, Caihong Yang, Yixiao Zhang

J. Comb. Theory B, 2025

Z-Shadow: An Efficient Method for Estimating Bicliques in Massive Graphs Using Füredi's Theorem.

Bole Chang, Linxin Xie, Wei Li, Meng Qin, Jianfeng Hou

Proceedings of the Proceedings 28th International Conference on Extending Database Technology, 2025

2024

The Turán number of three disjoint paths.

Jinghua Deng, Jianfeng Hou, Qinghou Zeng

Discuss. Math. Graph Theory, 2024

Counting triangles in graphs without vertex disjoint odd cycles.

Jianfeng Hou, Caihong Yang, Qinghou Zeng

Discret. Math., 2024

Faster coloring and embedding in dense hypergraphs via stability.

Jianfeng Hou, Xizhi Liu, Hongbin Zhao

CoRR, 2024

A 2-Stable Family of Triple Systems.

Yixiao Zhang, Jianfeng Hou, Heng Li

Electron. J. Comb., 2024

Extremal Graphs for the Suspension of Edge-Critical Graphs.

Jianfeng Hou, Heng Li, Qinghou Zeng

Electron. J. Comb., 2024

The zero-error capacity of binary channels with 2-memories.

Guofen Zhang, Ping Li, Jianfeng Hou, Bo Bai

Adv. Math. Commun., 2024

2023

On L(p,q)-labelling of planar graphs without cycles of length four.

Jianfeng Hou, Yindong Jin, Heng Li, Lianying Miao, Qian Zhao

Appl. Math. Comput., June, 2023

Large induced subgraphs with three repeated degrees.

Gaoxing Sun, Jianfeng Hou, Qinghou Zeng

Discret. Math., May, 2023

On (2,r)-choosability of planar graphs without short cycles.

Jianfeng Hou, Hongguo Zhu

Appl. Math. Comput., May, 2023

Coloring Squares of Planar Graphs with Maximum Degree at Most Five.

Jianfeng Hou, Yindong Jin, Lianying Miao, Qian Zhao

Graphs Comb., April, 2023

Graph partitioning: an updated survey.

Shufei Wu, Jianfeng Hou

AKCE Int. J. Graphs Comb., January, 2023

ClipSim: A GPU-friendly Parallel Framework for Single-Source SimRank with Accuracy Guarantee.

Tianhao Wu, Ji Cheng, Chaorui Zhang, Jianfeng Hou, Gengjian Chen, Zhongyi Huang, Weixi Zhang, Wei Han, Bo Bai

Proc. ACM Manag. Data, 2023

2022

Odd Induced Subgraphs in Planar Graphs with Large Girth.

Mengjiao Rao, Jianfeng Hou, Qinghou Zeng

Graphs Comb., 2022

On judicious bipartitions of directed graphs.

Shufei Wu, Jianfeng Hou

Discret. Math., 2022

Maximum bisections of graphs without cycles of length 4.

Mengjiao Rao, Jianfeng Hou, Qinghou Zeng

Discret. Math., 2022

2021

On bisections of graphs without complete bipartite graphs.

Jianfeng Hou, Shufei Wu

J. Graph Theory, 2021

Uniform tight frames as optimal signals.

Gergely Ambrus, Bo Bai, Jianfeng Hou

Adv. Appl. Math., 2021

Design and implementation of a bluetooth data communication middleware on smart phone.

Jianfeng Hou, Wei Song, Wei Zeng, Huiying Yang

Proceedings of the 14th International Symposium on Computational Intelligence and Design, 2021

Green Edge Intelligence Scheme for Mobile Keyboard Emoji Prediction.

Jianfeng Hou, Yinxu Tang, Xi Huang, Ziyu Shao, Yang Yang

Proceedings of the ICC 2021, 2021

2020

Erratum: The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs.

Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu

SIAM J. Discret. Math., 2020

On bipartitions of directed graphs with small semidegree.

Jianfeng Hou, Zhe Li, Shufei Wu

Eur. J. Comb., 2020

Choosability with union separation of triangle-free planar graphs.

Jianfeng Hou, Hongguo Zhu

Discret. Math., 2020

Max-Bisections of H-free graphs.

Jianfeng Hou, Juan Yan

Discret. Math., 2020

Choosability with union separation of planar graphs without cycles of length 4.

Jianfeng Hou, Hongguo Zhu

Appl. Math. Comput., 2020

2019

HydraDoctor: real-time liquids intake monitoring by collaborative sensing.

Bowen Du, Chris Xiaoxuan Lu, Xuan Kan, Kai Wu, Man Luo, Jianfeng Hou, Kai Li, Salil S. Kanhere, Yiran Shen, Hongkai Wen

Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

2018

The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs.

Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu

SIAM J. Discret. Math., 2018

Bipartitions of oriented graphs.

Jianfeng Hou, Shufei Wu

J. Comb. Theory B, 2018

Partitioning dense uniform hypergraphs.

Shufei Wu, Jianfeng Hou

J. Comb. Optim., 2018

On partitions of K2, 3-free graphs under degree constraints.

Jianfeng Hou, Huawen Ma, Jiguo Yu, Xia Zhang

Discret. Math., 2018

Bisections of Graphs Without Short Cycles.

Genghua Fan, Jianfeng Hou, Xingxing Yu

Comb. Probab. Comput., 2018

Maximum cuts of graphs with forbidden cycles.

Qinghou Zeng, Jianfeng Hou

Ars Math. Contemp., 2018

Requirement Analysis of Operational Network Organization Based on PDOA.

Jianfeng Hou, Ruicheng Yan

Proceedings of the 14th International Conference on Semantics, Knowledge and Grids, 2018

Military Scenario Named Entity Recognition Method Based on Deep Neural Network.

Xuefeng Wang, Xiaofei Zhou, Dongsheng Li, Jianfeng Hou

Proceedings of the 2018 International Conference on Control, 2018

Operational Network Topology Reeonfiguration Based on Foeus of Guarantee.

Jianfeng Hou, Ruicheng Yan, Ye He, Wangqi Miao, Xucfeng Wang, Dongsheng Li

Proceedings of the 2018 International Conference on Control, 2018

A Military Named Entity Relation Extraction Approach Based on Deep Learning.

Xuefeng Wang, Ruopeng Yang, Yulong Feng, Dongsheng Li, Jianfeng Hou

Proceedings of the 2018 International Conference on Algorithms, 2018

2017

Bounds for pairs in judicious partitioning of graphs.

Genghua Fan, Jianfeng Hou

Random Struct. Algorithms, 2017

On a Problem of Judicious <i>k</i>-Partitions of Graphs.

Jianfeng Hou, Qinghou Zeng

J. Graph Theory, 2017

On bisections of directed graphs.

Jianfeng Hou, Shufei Wu, Guiying Yan

Eur. J. Comb., 2017

Graphs of f-class 1.

Xia Zhang, Jianfeng Hou, Guizhen Liu, Guiying Yan

Discret. Appl. Math., 2017

Judicious Partitioning of Hypergraphs with Edges of Size at Most 2.

Jianfeng Hou, Qinghou Zeng

Comb. Probab. Comput., 2017

The Application of Augmented Reality Based on Body Parts Recognition.

Jianfeng Hou, Wei Song, Mengxuan Li

Proceedings of the Advances in Computer Science and Ubiquitous Computing, 2017

2016

On judicious partitions of uniform hypergraphs.

Jianfeng Hou, Shufei Wu, Guiying Yan

J. Comb. Theory A, 2016

Monochromatic Solutions for Multi-Term Unknowns.

Lei Cheng, Jianfeng Hou, Yusheng Li, Qizhong Lin

Graphs Comb., 2016

2015

On total colorings of 1-planar graphs.

Xin Zhang, Jianfeng Hou, Guizhen Liu

J. Comb. Optim., 2015

2014

A bound for judicious k-partitions of graphs.

Genghua Fan, Jianfeng Hou, Qinghou Zeng

Discret. Appl. Math., 2014

2013

Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs".

Jianfeng Hou, Jian-Liang Wu

J. Graph Theory, 2013

An improved bound on acyclic chromatic index of planar graphs.

Yue Guan, Jianfeng Hou, Yingyuan Yang

Discret. Math., 2013

Acyclic edge coloring of planar graphs with girth at least 5.

Jianfeng Hou, Weitao Wang, Xiaoran Zhang

Discret. Appl. Math., 2013

2012

A Planar linear arboricity conjecture.

Marek Cygan, Jianfeng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu

J. Graph Theory, 2012

Acyclic Edge Coloring of Planar Graphs Without Small Cycles.

Jianfeng Hou, Guizhen Liu, Jianliang Wu

Graphs Comb., 2012

A Bound on the bondage Number of toroidal Graphs.

Jianfeng Hou, Guizhen Liu

Discret. Math. Algorithms Appl., 2012

Acyclic edge coloring of sparse graphs

Jianfeng Hou

CoRR, 2012

2011

Acyclic chromatic index of planar graphs with triangles.

Jianfeng Hou, Nicolas Roussel, Jianliang Wu

Inf. Process. Lett., 2011

Improved bounds for acyclic chromatic index of planar graphs.

Jianfeng Hou, Guizhen Liu, Guanghui Wang

Discret. Appl. Math., 2011

Total coloring of planar graphs without 6-cycles.

Jianfeng Hou, Bin Liu, Guizhen Liu, Jianliang Wu

Discret. Appl. Math., 2011

Local condition for planar graphs of maximum degree 7 to be 8-totally colorable.

Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel

Discret. Appl. Math., 2011

2010

The method of coloring in graphs and its application.

Guizhen Liu, Jianfeng Hou

J. Syst. Sci. Complex., 2010

Acyclic edge chromatic number of outerplanar graphs.

Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu

J. Graph Theory, 2010

On the total choosability of planar graphs and of sparse graphs.

Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel

Inf. Process. Lett., 2010

Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles.

Jianfeng Hou, Bin Liu, Guizhen Liu, Jihui Wang

Int. J. Comput. Math., 2010

2009

Acyclic edge coloring of planar graphs with large girth.

Dongxiao Yu, Jianfeng Hou, Guizhen Liu, Bin Liu, Lan Xu

Theor. Comput. Sci., 2009

Edge-choosability of planar graphs without non-induced 5-cycles.

Jiansheng Cai, Jianfeng Hou, Xia Zhang, Guizhen Liu

Inf. Process. Lett., 2009

Total colorings of planar graphs without adjacent triangles.

Xiang-Yong Sun, Jianliang Wu, Yu-Wen Wu, Jianfeng Hou

Discret. Math., 2009

Total colorings and list total colorings of planar graphs without intersecting 4-cycles.

Bin Liu, Jianfeng Hou, Jianliang Wu, Guizhen Liu

Discret. Math., 2009

Edge-choosability of planar graphs without adjacent triangles or without 7-cycles.

Jianfeng Hou, Guizhen Liu, Jiansheng Cai

Discret. Math., 2009

On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability.

Jianfeng Hou, Guizhen Liu, Jianliang Wu

Ars Comb., 2009

The stability number and connected [k, k+1]-factor in graphs.

Jiansheng Cai, Guizhen Liu, Jianfeng Hou

Appl. Math. Lett., 2009

2008

List edge and list total colorings of planar graphs without short cycles.

Bin Liu, Jianfeng Hou, Guizhen Liu

Inf. Process. Lett., 2008

Binding number and Hamiltonian (<i>g, f</i>)-factors in graphs II.

Jiansheng Cai, Guizhen Liu, Jianfeng Hou

Int. J. Comput. Math., 2008

Total Colorings of Planar Graphs without Small Cycles.

Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan

Graphs Comb., 2008

2007

The linear arboricity of planar graphs with no short cycles.

Jianliang Wu, Jianfeng Hou, Guizhen Liu

Theor. Comput. Sci., 2007

Some results about <i>f</i>-critical graphs.

Guizhen Liu, Jianfeng Hou, Jiansheng Cai

Networks, 2007

On <i>f</i> -Edge Cover-Coloring of Simple Graphs.

Jihui Wang, Sumei Zhang, Jianfeng Hou

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Some Results on List Total Colorings of Planar Graphs.

Jianfeng Hou, Guizhen Liu, Jianliang Wu

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Binding Number and Connected ( <i>g</i> , <i>f</i> + 1)-Factors in Graphs.

Jiansheng Cai, Guizhen Liu, Jianfeng Hou

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006

List edge and list total colorings of planar graphs without 4-cycles.

Jianfeng Hou, Guizhen Liu, Jiansheng Cai

Theor. Comput. Sci., 2006