OpenAlex | Maximum cliques in a graph without disjoint given subgraph

Maximum cliques in a graph without disjoint given subgraph

Work

Year: 2024

Type: article

Source: Discrete Mathematics

Authors Fangfang Zhang, Yaojun Chen, Ervin Győri, Xiutao Zhu

Institutions Nanjing University of Finance and Economics, Nanjing University, Alfréd Rényi Institute of Mathematics, Ministry of Industry and Information Technology, Nanjing University of Aeronautics and Astronautics

Cites: 18

Cited by: 1

Related to: 10

FWCI: 3.291

Citation percentile (by year/subfield): 81.24

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders National Natural Science Foundation of China, National Natural Science Foundation of China, National Natural Science Foundation of China, Nemzeti Kutatási és Technológiai Hivatal, National Research, Development and Innovation Office +1 more

Grant IDS 12101298, 12161141003, 11931006, , K132696 +1 more