Results 71 to 80 of about 306 (178)
Parameterized Complexity of Equitable Coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and every color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times.
Guilherme de C. M. Gomes +2 more
doaj +1 more source
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, Volume 112, Issue 3, Page 337-351, July 2026.ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire +2 more
wiley +1 more source
Exact Solutions for the Moving Firefighter Problem on Trees
Networks, Volume 88, Issue 1, Page 42-58, July 2026.ABSTRACT The moving firefighter problem (MFP) is a more realistic variant of the classic firefighter problem (FP), where firefighters require time for both travel and defense. Unfortunately, the only known exact solution for the MFP does not scale. In this paper, we establish that the MFP is NP‐complete on trees of maximum degree three and present four
Mauro A. Montenegro‐Meza +4 more
wiley +1 more source
Recoloring via Modular Decomposition
Journal of Graph Theory, Volume 111, Issue 4, Page 113-123, April 2026.ABSTRACT The reconfiguration graph of the k‐colorings of a graph G, denoted R k ( G ), is the graph whose vertices are the k‐colorings of G and two colorings are adjacent in R k ( G ) if they differ in color on exactly one vertex. A graph G is said to be recolorable if R ℓ ( G ) is connected for all ℓ ≥ χ ( G ) + 1.
Manoj Belavadi +2 more
wiley +1 more source
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Size‐Ramsey Numbers of Structurally Sparse Graphs
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT Size‐Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erdős, Faudree, Rousseau, and Schelp in 1978. Research has mainly focused on the size‐Ramsey numbers of n$$ n $$‐vertex graphs with constant maximum degree Δ$$ \Delta $$.
Nemanja Draganić +4 more
wiley +1 more source
Augmenting Naïve Bayes Classifiers with k-Tree Topology
MathematicsThe Bayesian network is a directed, acyclic graphical model that can offer a structured description for probabilistic dependencies among random variables.
Fereshteh R. Dastjerdi, Liming Cai
doaj +1 more source
The Effect of Planarization on Width
Journal of Graph Algorithms and Applications, 2018 We study the effects on graph width parameters of planarization, the construction of a planar diagram from a non-planar graph drawing by replacing each crossing with a new vertex. We show that for treewidth, pathwidth, branchwidth, clique-width, and tree-
David Eppstein
doaj +1 more source
Expert Systems, Volume 43, Issue 3, March 2026.ABSTRACT Zero‐day exploits remain challenging to detect because they often appear in unknown distributions of signatures and rules. The article entails a systematic review and cross‐sectional synthesis of four fundamental model families for identifying zero‐day intrusions, namely, convolutional neural networks (CNN), deep neural networks (DNN ...
Abdullah Al Siam +3 more
wiley +1 more source
Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth
Journal of Graph Theory, Volume 110, Issue 3, Page 351-365, November 2025.ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t ≥ 4 and a graph H, every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either K t or H, if (and only if) H
Sepehr Hajebi
wiley +1 more source