Cover Image

The circumference of a graph with given minimum degree and clique number

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Na, Tang, Yurui
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

The number of edges in graphs with bounded clique number and circumference
by: Dou, Chunyang, et al.
Published: (2024)

Extremal number of cliques of given orders in graphs with a forbidden clique minor
by: Shi, Ruilin, et al.
Published: (2024)

Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)

The minimum size of a chordal graph with given order and minimum degree
by: Zhan, Xingzhi, et al.
Published: (2024)

Cycles and paths through specified vertices in graphs with a given clique number
by: Li, Chengli, et al.
Published: (2025)

A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)

The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

A closure result on spanning $k$-trees of graphs with given minimum degree
by: Zhang, Wenqian
Published: (2026)

On the oriented diameter of graphs with given minimum degree
by: Cochran, Garner, et al.
Published: (2024)

Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
by: Zhang, Zhenhao, et al.
Published: (2026)

Maximizing subgraph density in graphs of bounded degree and clique number
by: Kirsch, Rachel
Published: (2025)

On the $4$-clique cover number of graphs
by: Chen, Yihan, et al.
Published: (2025)

On the isolation number of graphs with minimum degree four
by: Goddard, Wayne, et al.
Published: (2025)

Extending two results on hamiltonian graphs involving the bipartite-hole-number
by: Cheng, Kun, et al.
Published: (2025)

Graphs with given automorphism group and large clique number
by: Haslegrave, John
Published: (2025)

Cycles and paths through vertices whose degrees are at least the bipartite-hole-number
by: Li, Chengli, et al.
Published: (2025)

The minimum edge-pancyclic graph of a given order
by: Zhao, Xiamiao, et al.
Published: (2025)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

On the clique covering numbers of Johnson graphs
by: Jørgensen, Søren Fuglede
Published: (2025)

The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
by: Ouyang, Zhangdong, et al.
Published: (2025)

On the distance spectral radius, fractional matching and factors of graphs with given minimum degree
by: Xu, Zengzhao, et al.
Published: (2023)

Oriented diameter of graphs with given domination number
by: Wang, Xiaolin, et al.
Published: (2025)

The maximum number of cliques in disjoint copies of graphs
by: Gao, Zhipeng, et al.
Published: (2025)

Nordhaus-Gaddum inequalities for the number of cliques in a graph
by: Bal, Deepak, et al.
Published: (2024)

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers
by: Ágoston, Péter, et al.
Published: (2025)

The minimum number of detours in a connected graph of minimum degree three
by: Liu, Xining, et al.
Published: (2026)

The minimum size of a $k$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2025)

The minimum size of a $3$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2024)

Extremal graphs with minimum number of connected subgraphs in a given family
by: Pandey, Dinesh, et al.
Published: (2025)

Edge density and minimum degree thresholds for $H$-free graphs with unbounded chromatic number
by: Wu, Zhuo, et al.
Published: (2025)

Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)

Odd clique minors in graphs with independence number two
by: Ji, Yuqing, et al.
Published: (2025)

Fractional domatic number and minimum degree
by: Chuet, Quentin, et al.
Published: (2025)

Building graphs with high minimum degree on a budget
by: Katsamaktsis, Kyriakos, et al.
Published: (2024)

The independence and clique cover numbers of the squarefree graph
by: Alexeev, Boris, et al.
Published: (2025)

Coloring graphs with independence number two and no odd clique immersions
by: Echeverría, Henry, et al.
Published: (2026)

Intertwining local (adjacency) metric dimension with the clique number of a graph
by: Ghalavand, Ali, et al.
Published: (2025)