The odd independence number of graphs, I: Foundations and classical classes
Fuente:
arXiv
Saved in:
| Main Authors: | Caro, Yair, Petruševski, Mirko, Škrekovski, Riste, Tuza, Zsolt |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)
by: Caro, Yair, et al.
Published: (2025)
Domination number of modular product graphs
by: Bermudo, Sergio, et al.
Published: (2024)
by: Bermudo, Sergio, et al.
Published: (2024)
Monochromatic graph decompositions inspired by anti-Ramsey colorings
by: Caro, Yair, et al.
Published: (2024)
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)
by: Brešar, Boštjan, et al.
Published: (2024)
Injective coloring of product graphs
by: Samadi, Babak, et al.
Published: (2023)
by: Samadi, Babak, et al.
Published: (2023)
Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products
by: Babu, Saneesh, et al.
Published: (2025)
by: Babu, Saneesh, et al.
Published: (2025)
Independence numbers of the 2-token graphs of some join graphs
by: Rivera, Luis Manuel, et al.
Published: (2025)
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)
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)
by: Tout, Omar
Published: (2023)
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)
by: Troncoso, E. Acosta, et al.
Published: (2026)
Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
by: Torres, Pablo
Published: (2025)
by: Torres, Pablo
Published: (2025)
Equitable Dominator Coloring of Line Graphs of Some Graphs
by: George, Phebe Sarah, et al.
Published: (2024)
by: George, Phebe Sarah, et al.
Published: (2024)
Monophonic number of Kneser graphs and strongly 2-monophonic graphs
by: Brešar, Boštjan, et al.
Published: (2025)
by: Brešar, Boštjan, et al.
Published: (2025)
On a conjecture about the strong odd chromatic number of planar graphs
by: Manattu, Arun J, et al.
Published: (2026)
by: Manattu, Arun J, et al.
Published: (2026)
On k-(total) limited packing in graphs
by: Ahmadi, Azam Sadat, et al.
Published: (2024)
by: Ahmadi, Azam Sadat, et al.
Published: (2024)
Exact double domination in subdivision, Mycielskian and middle graphs
by: Behtoei, Ali, et al.
Published: (2024)
by: Behtoei, Ali, et al.
Published: (2024)
Adjacency-diametrical matrix of a graph
by: Amruthavarshini, S. P. Leka, et al.
Published: (2026)
by: Amruthavarshini, S. P. Leka, et al.
Published: (2026)
Treewidth versus clique number. V. Further connections with tree-independence number
by: Hilaire, Claire, et al.
Published: (2025)
by: Hilaire, Claire, et al.
Published: (2025)
Refinement of a conjecture on positive square energy of graphs
by: Akbari, Saieed, et al.
Published: (2025)
by: Akbari, Saieed, et al.
Published: (2025)
Characterizing all nonbipartite well-edge-dominated graphs
by: Anderson, Sarah E., et al.
Published: (2026)
by: Anderson, Sarah E., et al.
Published: (2026)
Characterizing all $K_4$-free well-edge-dominated graphs of girth 3
by: Anderson, Sarah E., et al.
Published: (2025)
by: Anderson, Sarah E., et al.
Published: (2025)
Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024)
by: Bresar, Bostjan, et al.
Published: (2024)
Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)
by: Kashima, Masaki, et al.
Published: (2025)
Nordhaus-Gaddum-type theorems for maximum average degree
by: Caro, Yair, et al.
Published: (2025)
by: Caro, Yair, et al.
Published: (2025)
$[k]$-Roman domination on cylindrical grids $C_m \Box P_n$
by: Brezovnik, Simon, et al.
Published: (2026)
by: Brezovnik, Simon, et al.
Published: (2026)
Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)
by: Brezovnik, Simon, et al.
Published: (2026)
by: Brezovnik, Simon, et al.
Published: (2026)
Co-even Domination Number of a Modified Graph by Operations on a Vertex or an Edge
by: Ghanbari, Nima, et al.
Published: (2021)
by: Ghanbari, Nima, et al.
Published: (2021)
The number of distinguishing colorings of a Cartesian product graph
by: Alikhani, Saeid, et al.
Published: (2021)
by: Alikhani, Saeid, et al.
Published: (2021)
Graphs with constant links and induced Turán numbers
by: Caro, Yair, et al.
Published: (2024)
by: Caro, Yair, et al.
Published: (2024)
Graphs with girth $2\ell+1$ and without longer odd holes that contain an odd $K_4$-subdivision
by: Chen, Rong, et al.
Published: (2022)
by: Chen, Rong, et al.
Published: (2022)
Cardinalities of the total number of independent sets
by: Kovács, Benedek, et al.
Published: (2025)
by: Kovács, Benedek, et al.
Published: (2025)
Moving through Cartesian products, coronas and joins in general position
by: Klavžar, Sandi, et al.
Published: (2025)
by: Klavžar, Sandi, et al.
Published: (2025)
Computing the Exchange Number in Graphs with respect to Cycle Convexity
by: Nair, Revathy S., et al.
Published: (2026)
by: Nair, Revathy S., et al.
Published: (2026)
Lower General Position in Cartesian Products
by: Welton, Eartha Kruft, et al.
Published: (2024)
by: Welton, Eartha Kruft, et al.
Published: (2024)
Complexity and Structural Results for the Hull and Convexity Numbers in Cycle Convexity for Graph Products
by: Anand, Bijo S., et al.
Published: (2024)
by: Anand, Bijo S., et al.
Published: (2024)
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)
by: Dallard, Clément, et al.
Published: (2024)
On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)
by: Harant, Jochen, et al.
Published: (2025)
The minimum number of maximal independent sets in twin-free graphs
by: Cambie, Stijn, et al.
Published: (2022)
by: Cambie, Stijn, et al.
Published: (2022)
Strengthening Wilf's lower bound on clique number
by: Jadav, Hareshkumar, et al.
Published: (2025)
by: Jadav, Hareshkumar, et al.
Published: (2025)
On the $δ$-chromatic numbers of the Cartesian products of graphs
by: Tangjai, Wipawee, et al.
Published: (2024)
by: Tangjai, Wipawee, et al.
Published: (2024)
Similar Items
-
The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025) -
Domination number of modular product graphs
by: Bermudo, Sergio, et al.
Published: (2024) -
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)