Results 61 to 70 of about 331 (182)

Face Sizes and the Connectivity of the Dual

Journal of Graph Theory, Volume 110, Issue 4, Page 379-391, December 2025.
ABSTRACT For each c ≥ 1, we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of c‐connected maps. Using these bounds, we determine the smallest genus on which a c‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a c‐connected map can ...
Gunnar Brinkmann, Kenta Noguchi, Heidi Van den Camp   +2 more
wiley   +1 more source

A general framework on conditions for constraint‐based causal learning

Scandinavian Journal of Statistics, Volume 52, Issue 4, Page 2209-2241, December 2025.
Abstract Most constraint‐based causal learning algorithms provably return the correct causal graph under certain correctness conditions, such as faithfulness. By representing any constraint‐based causal learning algorithm using the notion of a property, we provide a general framework to obtain and study correctness conditions for these algorithms. From
Kai Z. Teh, Kayvan Sadeghi, Terry Soo
wiley   +1 more source

On Hereditary Helly classes of graphs

Discrete Mathematics & Theoretical Computer Science, 2008
In graph theory, the Helly property has been applied to families of sets, such as cliques, disks, bicliques, and neighbourhoods, leading to the classes of clique-Helly, disk-Helly, biclique-Helly, neighbourhood-Helly graphs, respectively.
Marina Groshaus, Jayme Luiz Szwarcfiter
doaj  

Ransomware Detection Using Sample Entropy and Graphical Models: A Methodology for Explainable Artificial Intelligence (XAI) in Cybersecurity

Applied Stochastic Models in Business and Industry, Volume 41, Issue 6, November/December 2025.
ABSTRACT Malware detection poses a critical challenge for both society and Business and Industry (B&I), particularly given the necessity for secure digital transformation. Among various cybersecurity threats, ransomware has emerged as especially disruptive, capable of halting operations, interrupting business continuity, and causing significant ...
Danilo Bruschi, Marzio De Corato, Alfio Ferrara, Silvia Salini   +3 more
wiley   +1 more source

Spanning Plane Subgraphs of 1‐Plane Graphs

Journal of Graph Theory, Volume 110, Issue 3, Page 290-297, November 2025.
ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi, Katsuhiro Ota, Yusuke Suzuki   +2 more
wiley   +1 more source

DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles

Mathematics
In order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj   +1 more source

Assessment of road network vulnerability using multilayer perceptron surrogates with automated closure propagation

Computer-Aided Civil and Infrastructure Engineering, Volume 40, Issue 28, Page 5325-5350, 28 November 2025.
Abstract Road networks face increasing disruptions, yet vulnerability assessment methods either oversimplify traffic dynamics or require extensive computational simulations. This research introduces a novel approach integrating traffic simulation, graph theory, and machine learning for efficient and accurate vulnerability assessment.
Abdel Rahman Marian, Mohammad Zaher Serdar, Eyad Masad   +2 more
wiley   +1 more source

Characterization and recognition of edge intersection graphs of 3-chromatic hypergraphs with multiplicity at most than two in the class of split graphs

Журнал Белорусского государственного университета: Математика, информатика, 2018
Let Lm(k) denote the class of edge intersection graphs of k-chromatic hypergraphs with multiplicity at most m. It is known that the problem of recognizing graphs from L1(k) is polynomially solvable if k = 2 and is NP-complete if k = 3.
Tatiana V. Lubasheva, Yury M. Metelsky
doaj  

Indiscernibles in monadically NIP theories

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3326-3345, November 2025.
Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
wiley   +1 more source

An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations

Networks, Volume 86, Issue 3, Page 241-262, October 2025.
ABSTRACT This article proposes an implicit enumeration approach to solve the maximum ratio s$$ s $$‐plex and the maximum ratio s$$ s $$‐defective clique problems. The approach is inspired by the classical Bron‐Kerbosch algorithm for enumerating all maximal cliques in a graph, which is extended to enumerating structures that are hereditary on induced ...
Yehor Blokhin, Sergiy Butenko, Mykyta Makovenko, Petar Momcilovic, Oleg A. Prokopyev   +4 more
wiley   +1 more source