Cover Image

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Caro, Yair, Petruševski, Mirko, Škrekovski, Riste, Tuza, Zsolt
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C09, 05C15, 05C69, 05C63, 05C76
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Domination number of modular product graphs
by: Bermudo, Sergio, et al.
Published: (2024)

The number of distinguishing colorings of a Cartesian product graph
by: Alikhani, Saeid, et al.
Published: (2021)

Monochromatic graph decompositions inspired by anti-Ramsey colorings
by: Caro, Yair, et al.
Published: (2024)

Injective colorings of Sierpiński-like graphs and Kneser graphs
by: Brešar, Boštjan, et al.
Published: (2024)

Injective coloring of product graphs
by: Samadi, Babak, et al.
Published: (2023)

Trivial coloring of Cartesian product of graphs
by: Csernák, Tamás
Published: (2023)

Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products
by: Babu, Saneesh, et al.
Published: (2025)

On tree-decompositions for infinite chordal graphs
by: Pitz, Max, et al.
Published: (2026)

Independence numbers of the 2-token graphs of some join graphs
by: Rivera, Luis Manuel, et al.
Published: (2025)

Independence numbers of some double vertex graphs and pair graphs
by: Jiménez-Sepúlveda, Paloma, et al.
Published: (2018)

On the domination number of the cartesian product of the path graph and any pair of graphs
by: Tout, Omar
Published: (2023)

Monophonic number of Kneser graphs and strongly 2-monophonic graphs
by: Brešar, Boštjan, et al.
Published: (2025)

An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
by: Troncoso, E. Acosta, et al.
Published: (2026)

On k-(total) limited packing in graphs
by: Ahmadi, Azam Sadat, et al.
Published: (2024)

Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
by: Torres, Pablo
Published: (2025)

Towards the essence of Šoltés' problem
by: Cambie, Stijn
Published: (2024)

On a conjecture about the strong odd chromatic number of planar graphs
by: Manattu, Arun J, et al.
Published: (2026)

Adjacency-diametrical matrix of a graph
by: Amruthavarshini, S. P. Leka, et al.
Published: (2026)

Equitable Dominator Coloring of Line Graphs of Some Graphs
by: George, Phebe Sarah, et al.
Published: (2024)

Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024)

On Proper Colorings of Functions
by: Csernák, Tamás
Published: (2022)

Refinement of a conjecture on positive square energy of graphs
by: Akbari, Saieed, et al.
Published: (2025)

Characterizing all nonbipartite well-edge-dominated graphs
by: Anderson, Sarah E., et al.
Published: (2026)

On the existence of neutral graph
by: Ma, Fei
Published: (2025)

Some results on $σ_{t}$-irregularity
by: Filipovski, Slobodan, et al.
Published: (2024)

Exact double domination in subdivision, Mycielskian and middle graphs
by: Behtoei, Ali, et al.
Published: (2024)

Characterizing all $K_4$-free well-edge-dominated graphs of girth 3
by: Anderson, Sarah E., et al.
Published: (2025)

Marcello's completion of graphs
by: Kok, Johan
Published: (2025)

Treewidth versus clique number. V. Further connections with tree-independence number
by: Hilaire, Claire, et al.
Published: (2025)

Edge-vertex degree based Zagreb index and graph operations
by: Sinha, Amitariddhi, et al.
Published: (2025)

$[k]$-Roman domination on cylindrical grids $C_m \Box P_n$
by: Brezovnik, Simon, et al.
Published: (2026)

Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)

Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)
by: Brezovnik, Simon, et al.
Published: (2026)

The minimum number of maximal independent sets in twin-free graphs
by: Cambie, Stijn, et al.
Published: (2022)

Full classification of anti-van der Waerden numbers of graph products of forests
by: Berikkyzy, Zhanar, et al.
Published: (2025)

On the $δ$-chromatic numbers of the Cartesian products of graphs
by: Tangjai, Wipawee, et al.
Published: (2024)

List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)

Interval edge-colorings of Cartesian products of graphs II
by: Petrosyan, Petros A., et al.
Published: (2024)

Nordhaus-Gaddum-type theorems for maximum average degree
by: Caro, Yair, et al.
Published: (2025)