Results 41 to 50 of about 735 (221)

Graphs with forbidden subgraphs

Journal of Combinatorial Theory, Series B, 1971
AbstractMany graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain.
Chartrand, Gary, Geller, Dennis, Hedetniemi, Stephen   +2 more
openaire   +2 more sources

On Sequential Heuristic Methods for the Maximum Independent Set Problem

Discussiones Mathematicae Graph Theory, 2017
We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO [11], MIN [12], or MAX [6] , are revisited. We combine Algorithm MIN with the α-redundant vertex technique[3].
Lê Ngoc C., Brause Christoph, Schiermeyer Ingo   +2 more
doaj   +1 more source

On the 12-Representability of Induced Subgraphs of a Grid Graph

Discussiones Mathematicae Graph Theory, 2022
The notion of a 12-representable graph was introduced by Jones, Kitaev, Pyatkin and Remmel in [Representing graphs via pattern avoiding words, Electron. J. Combin. 22 (2015) #P2.53].
Chen Joanna N., Kitaev Sergey
doaj   +1 more source

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

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

Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5−e)-free subgraphs [PDF]

Discrete Mathematics Letters, 2021
Rachel Johnson, David Mendell, Samantha Norris, Michael J. Plantholt, Shailesh K. Tipnis   +4 more
doaj   +1 more source

Characterizing the forbidden pairs for graphs to be super-edge-connected

AKCE International Journal of Graphs and Combinatorics
Let [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text].
Hazhe Ye, Yingzhi Tian
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

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