Cover Image

Coloring graphs with independence number two and no odd clique immersions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Echeverría, Henry, McDonald, Jessica
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

Totally odd immersions of complete graphs in graph products
by: Echeverría, Henry, et al.
Published: (2025)

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

On graphs with chromatic number and maximum degree both equal to nine
by: Galindo, Rachel, et al.
Published: (2024)

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

A simple proof of the existence of complete bipartite graph immersion in graphs with independence number two
by: Chen, Rong, et al.
Published: (2024)

Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)

Extending total colorings in planar graphs
by: Henderschedt, Owen, et al.
Published: (2025)

On the proper rainbow saturation numbers of cliques, paths, and odd cycles
by: Baker, Dustin, et al.
Published: (2024)

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

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

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

Maximizing the number of stars in graphs with forbidden properties
by: Berikkyzy, Zhanar, et al.
Published: (2025)

Packing independent cliques into planar graphs
by: Biró, Csaba, 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)

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

Connected matching in graphs with independence number two
by: Chen, Rong, et al.
Published: (2024)

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

Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)

Total coloring graphs with large maximum degree
by: Dalal, Aseem, et al.
Published: (2024)

Hadwiger's Conjecture for some graphs with independence number two
by: Li, Tong, et al.
Published: (2023)

Totally odd immersions in line graphs
by: Jiménez, Andrea, et al.
Published: (2023)

On orientations with forbidden out-degrees
by: Henderschedt, Owen, et al.
Published: (2024)

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

The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)

Odd Hadwiger number and graph products
by: Echeverría, Henry, et al.
Published: (2026)

Seymour and Woodall's conjecture holds for graphs with independence number two
by: Chen, Rong, et al.
Published: (2024)

On graphs with girth at least five achieving Steffen's edge coloring bound
by: Chen, Guantao, et al.
Published: (2026)

Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
by: Caro, Yair, et al.
Published: (2024)

The odd independence number of graphs, I: Foundations and classical classes
by: Caro, Yair, et al.
Published: (2025)

Totally odd subdivisions in Kneser graphs
by: Echeverría, Henry, et al.
Published: (2025)

The maximum number of $k$-cliques of 7-connected 1-planar graphs
by: Huang, Yuanqiu, et al.
Published: (2026)

Interplay between the local metric dimension and the clique number of a graph
by: Ghalavand, Ali, et al.
Published: (2024)

The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
by: Abiad, Aida, et al.
Published: (2024)

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

Coloring of graphs without long odd holes
by: Chen, Ran, et al.
Published: (2025)

Multicolor Turán numbers II -- a generalization of the Ruzsa-Szemerédi theorem and new results on cliques and odd cycles
by: Kovács, Benedek, et al.
Published: (2022)

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

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

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

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