Search Results - "INDEPENDENT sets"

Large Independent Sets in Recursive Markov Random Graphs.

Authors: Gupte, Akshay Zhu, Yiran

Source: Mathematics of Operations Research (INFORMS). Aug2025, Vol. 50 Issue 3, p1611-1634. 24p.

Independent double roman domination number of a tree in terms of its 2-independence number.

Authors: Koulivand, Halimeh Habibi, Mohammad Arianpoor, Hassan et al.

Source: Discrete Mathematics, Algorithms & Applications. Apr2026, Vol. 18 Issue 3, p1-11. 11p.

Semidefinite Approximations for Bicliques and Bi-Independent Pairs.

Authors: Laurent, Monique Polak, Sven Vargas, Luis Felipe

Source: Mathematics of Operations Research (INFORMS). Feb2025, Vol. 50 Issue 1, p537-572. 36p.

On induced subgraphs of H(n, 3) with maximum degree 1.

Authors: Potechin, Aaron Tsang, Hing Yin

Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2026, Vol. 28 Issue 2, p1-41. 41p.

Subjects: Independent sets, Subgraphs, Discrete mathematics, Combinatorics, Graph theory

CLIQUE MINORS IN SOME GRAPHS WITH INDEPENDENCE NUMBER TWO.

Authors: Zhang, Jie Deng, Zijian

Source: Advances & Applications in Discrete Mathematics. Feb2026, Vol. 43 Issue 2, p155-166. 12p.

Subjects: Graph theory, Independent sets, Graph coloring

ON THE INDEPENDENT DOM-SATURATION NUMBER OF A GRAPH.

Authors: Muthulakshmi, T. Subramanian, M.

Source: Advances & Applications in Discrete Mathematics. Jan2026, Vol. 43 Issue 1, p33-47. 15p.

Subjects: Graph theory, Independent sets, Combinatorial optimization

Pancyclicity of Hamiltonian graphs.

Authors: Draganić, Nemanja Correia, David Munhá Sudakov, Benny

Source: Journal of the European Mathematical Society (EMS Publishing). 2026, Vol. 238 Issue 9, p4047-4062. 16p.

A 43-approximation for the maximum leaf spanning arborescence problem in DAGs.

Authors: Neuwohner, Meike¹, work@meike-neuwohner.de

Source: Mathematical Programming; Mar2026, Vol. 216 Issue 1/2, p111-133, 23p

Lower bounds on the complexity of mixed-integer programs for stable set and knapsack.

Authors: Schade, Jamico Sinha, Makrand Weltge, Stefan

Source: Mathematical Programming; Mar2026, Vol. 216 Issue 1/2, p135-176, 42p

On lower bounds of the density of planar periodic sets without unit distances.

Authors: Tolmachev, Alexander^1,2,3 (AUTHOR) aleksandr.tolmachev@skoltech.ru

Source: Discrete Mathematics, Algorithms & Applications. Mar2026, Vol. 18 Issue 2, p1-20. 20p.

Three forms of the Erdős--Dushnik--Miller theorem.

Authors: Howard, Paul Tachtsis, Eleftherios

Source: Fundamenta Mathematicae. 2026, Vol. 272 Issue 2, p171-203. 33p.

An Exact Algorithm for Counting the Number of Independent Sets of a Graph.

Authors: De Ita Luna, Guillermo Marcial-Romero, J. Raymundo Bello López, Pedro et al.

Source: Mathematics (2227-7390). Jan2026, Vol. 14 Issue 2, p275. 16p.

Adjacent Line Graphs: Combinatorial Bounds and Structural Properties.

Authors: Obayes 1., Karrar Khudhair Obayes, Ghadeer Khudhair

Source: Journal of Qadisiyah Computer Science & Mathematics; 2026, Vol. 18 Issue 1, p1-8, 8p

Advances in the Shannon capacity of graphs.

Authors: Lavi, Nitay Sason, Igal

Source: AIMS Mathematics. 2026, Vol. 11 Issue 1, p1-50. 50p.

A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length.

Authors: Vazirani, Vijay V.¹ vazirani@ics.uci.edu

Source: Mathematics of Operations Research (INFORMS). Aug2024, Vol. 49 Issue 3, p2009-2047. 39p.

On the independence number of a variant of the divisor graph.

Authors: Sivankutty, Midhun¹ (AUTHOR) midhunsklm20@gmail.com

Source: RAIRO: Operations Research (2804-7303). 2025, Vol. 59 Issue 6, p3523-3527. 5p.

Subjects: Independent sets, Graph theory, Combinatorial designs & configurations, Integers

On star polynomials of digraphs and their applications to domination.

Authors: Daaga, Akhenaton Farrell, E. J.

Source: Journal of Combinatorial Mathematics & Combinatorial Computing. Mar2026, Vol. 128, p59-81. 23p.

New Upper Bounds on the Number of Maximum Independent Sets in a Graph.

Authors: Levit, Vadim E. Itskovich, Elizabeth J.

Source: Axioms (2075-1680). Dec2025, Vol. 14 Issue 12, p900. 19p.

THE PERFECT CODES OF NON-COPRIME AND COPRIME GRAPHS.

Authors: TOLUE, BEHNAZ ERFANIAN, AHMAD

Source: Kragujevac Journal of Mathematics. 2025, Vol. 49 Issue 6, p913-923. 11p.

New Ramsey Multiplicity Bounds and Search Heuristics.

Authors: Parczyk, Olaf Pokutta, Sebastian Spiegel, Christoph et al.

Source: Foundations of Computational Mathematics; Oct2025, Vol. 25 Issue 5, p1777-1814, 38p