Cover Image

Efficient Enumeration of Cliques in Graphs with Bounded Maximum Degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gong, Shi-Cai, Wang, Jia-Jin, Zhu, Xin-Hao, Yuan, Bo-Jun
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
by: Galindo, Rachel, et al.
Published: (2025)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)

Cliques in Squares of Graphs with Maximum Average Degree less than 4
by: Cranston, Daniel W., et al.
Published: (2023)

Judicious Partitions in Edge-Weighted Graphs with Bounded Maximum Weighted Degree
by: Gutin, G., et al.
Published: (2025)

Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem
by: Ciccarelli, Fabio, et al.
Published: (2025)

Sparse Partitions of Graphs with Bounded Clique Number
by: Girão, António, et al.
Published: (2024)

On Clique Graphs and Clique Regular Graphs
by: Petro, Robert R., et al.
Published: (2025)

Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
by: Dujmović, Vida, et al.
Published: (2022)

A Comprehensive Study of Clique Graphs and Clique Regular Graphs
by: Phillips, Connor
Published: (2026)

Maximum Spread of Vertex Degrees in a Simple Graph
by: Onishchenko, Sergey Dmitrievich
Published: (2025)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
by: Bhyravarapu, Sriram, et al.
Published: (2021)

Clustered Coloring of Graphs with Bounded Layered Treewidth and Bounded Degree
by: Liu, Chun-Hung, et al.
Published: (2022)

2-Distance Coloring of Planar Graphs with Specific Maximum Degree
by: Hajjar, Sara Al
Published: (2025)

Proper Conflict-free Coloring of Graphs with Large Maximum Degree
by: Cranston, Daniel W., et al.
Published: (2022)

Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)

On Wegner's 8-Coloring Theorem for Planar Graphs of Maximum Degree Three
by: Elvin, Gabriel, et al.
Published: (2025)

Partition of Sparse Graphs into Two Forests with Bounded Degree
by: Yancey, Matthew
Published: (2024)

A Linear Bound on the Rich Flow Number for Graphs with a Given Maximum Degree
by: Lukoťka, Robert
Published: (2026)

Rainbow Cliques in Edge-Colored Graphs
by: Czygrinow, Andrzej, et al.
Published: (2024)

A Note on Reconfiguration Graphs of Cliques
by: Lam, Quan N., et al.
Published: (2025)

On $S$-packing Coloring of Bounded Degree Graphs
by: Mortada, Maidoun, et al.
Published: (2025)

Odd Induced Subgraphs in Graphs of Maximum Degree Four
by: Ai, Jiangdong, et al.
Published: (2025)

On Realizing Reconfiguration Graphs of Cliques
by: Hoang, Duc A.
Published: (2026)

Infinite Cliques in Simple and Stable Graphs
by: Halevi, Yatir, et al.
Published: (2024)

The number of dissociation sets in connected graphs
by: Yuan, Bo-Jun, et al.
Published: (2024)

Maximal and maximum induced matchings in connected graphs
by: Yuan, Bo-Jun, et al.
Published: (2024)

String Graph Obstacles of High Girth and of Bounded Degree
by: Chudnovsky, Maria, et al.
Published: (2025)

Bounding Clique Size in Squares of Planar Graphs
by: Cranston, Daniel W.
Published: (2023)

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
by: Sanghi, Aryan, et al.
Published: (2026)

On Expansion of Random Regular Graphs: Improved Lower Bounds for Small Even Degrees
by: Manurangsi, Pasin
Published: (2026)

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
by: D'Elia, Marco, et al.
Published: (2024)

Chromatic and Clique number of Generalized Sierpiński Gasket Graph $S[G,t]$
by: Attarzadeh, Fatemeh, et al.
Published: (2024)

Maximal Cliques in Scale-Free Random Graphs
by: Bläsius, Thomas, et al.
Published: (2023)

Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing
by: Pelofske, Elijah, et al.
Published: (2022)

Enumerating Two-Orbit Graphs
by: Seka, David, et al.
Published: (2026)

Enumeration of dicirculant digraphs
by: Wang, Jing, et al.
Published: (2024)

Characterising Clique Convergence for Locally Cyclic Graphs of Minimum Degree $δ\ge 6$
by: Limbach, Anna M., et al.
Published: (2023)

An Efficient Algorithm for Vertex Enumeration of Arrangement
by: Dong, Zelin, et al.
Published: (2024)

Clique density vs blowups
by: Bradač, Domagoj, et al.
Published: (2024)

Triangle-free Graphs with Large Minimum Common Degree
by: Wang, Jian, et al.
Published: (2024)