Addendum10.1016/j.disc.2026.115065Corrigendum to “Nice vertices in cubic graphs” [Discrete Math. 348 (2025) 114553Feb 01, 2026Discrete MathematicsWuxian Chen + 2 more +2CiteListenSave
Research Article10.1016/j.disc.2025.114720Which Laplacian cospectral graphs have the same degree sequences?Feb 01, 2026Discrete MathematicsQianlin Yao + 3 more +3CiteListenSave
Research Article10.1016/j.disc.2025.114694A tensor's spectral bound on the clique numberFeb 01, 2026Discrete MathematicsChunmeng Liu + 1 more +1CiteListenSave
Research Article110.1016/j.disc.2025.114809On the structure of perfectly divisible graphsFeb 01, 2026Discrete MathematicsChính T HoàngCiteListenSave
Research Article10.1016/j.disc.2025.114848Characterizing families of lines meeting a hermitian variety of PG(3,q2) in q + 1 pointsFeb 01, 2026Discrete MathematicsStuti Mohanty + 1 more +1CiteListenSave
Research Article10.1016/j.disc.2025.114697The r-dynamic chromatic number is bounded in the strong 2-coloring numberFeb 01, 2026Discrete MathematicsMiriam Goetze + 1 more +1A proper vertex-coloring of a graph is r -dynamic if the neighbors of each vertex v receive at least min ( r , deg ( v ) ) different colors. In this note, we prove that if G has strong 2-coloring number at most k , then G admits an r -dynamic coloring with no more than ( k − 1 ) r + 1 colors. As a consequence, for every class of graphs of bounded expansion, the r -dynamic chromatic number is bounded by a linear function in r . We give a concrete upper bound for graphs of bounded row-treewidth, which includes for example all planar graphs.Read moreCiteListenSave
Research Article10.1016/j.disc.2025.114730Boundedness for proper conflict-free and odd coloringsFeb 01, 2026Discrete MathematicsA Jiménez + 9 more +9CiteListenSave
Research Article110.1016/j.disc.2025.114739Fractional forcing number of graphsFeb 01, 2026Discrete MathematicsJavad B Ebrahimi + 1 more +1CiteListenSave
Research Article10.1016/j.disc.2025.114768Minimum bisections of graphs without even cyclesFeb 01, 2026Discrete MathematicsMengjiao Rao + 1 more +1CiteListenSave
Research Article10.1016/j.disc.2025.114749The b-symbol weight hierarchies of two families of cyclic codes over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">F</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>q</mml:mi> </mml:mrow> </mml:msub> </mml:math>Feb 01, 2026Discrete MathematicsTonghui Zhang + 2 more +2CiteListenSave