Results 41 to 50 of about 772 (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 +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. +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
On Multilevel Energy‐Based Fragmentation Methods
International Journal of Quantum Chemistry, Volume 126, Issue 3, January 30, 2026.We investigate the working equations of energy‐based fragmentation methods and present ML‐SUPANOVA, a Möbius‐inversion‐based multilevel fragmentation scheme that enables adaptive, quasi‐optimal truncations to efficiently approximate Born‐Oppenheimer potentials across hierarchies of electronic‐structure methods and basis sets.
James Barker +2 more
wiley +1 more source
Assigning airport ground handling operations: a data‐driven matheuristic
International Transactions in Operational Research, Volume 33, Issue 1, Page 359-383, January 2026.Abstract In this paper, we study a problem in the crossover between vehicle routing and scheduling problems. The multi‐trip capacitated vehicle routing and scheduling problem with time windows and meal breaks is extended to a heterogeneous fleet of trucks and drivers, with qualifications and different loading patterns.
Alexandre Dupaquis +5 more
wiley +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 +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 +4 more
doaj +1 more source
Characterizing the forbidden pairs for graphs to be super-edge-connected
AKCE International Journal of Graphs and CombinatoricsLet [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
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
Line Graphs and Forbidden Induced Subgraphs
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lai, Hong-Jian, Šoltés, Ľubomír
openaire +1 more source