Results 51 to 60 of about 312 (179)
Nearly Hamilton cycles in sublinear expanders and applications
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due to their potential for various applications to embedding problems in sparse graphs.
Shoham Letzter +2 more
wiley +1 more source
Some Variations of Perfect Graphs
Discussiones Mathematicae Graph Theory, 2016 We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively.
Dettlaff Magda +3 more
doaj +1 more source
Graph Classes Generated by Mycielskians
Discussiones Mathematicae Graph Theory, 2020 In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following sequence: M′0(G) = G, M′1(G) = M′(G), and M′n(G) = M′(M′n−1(G)), to show that if G is a complete graph of order p, then the above sequence is a generator ...
Borowiecki Mieczys law +3 more
doaj +1 more source
Characterising and recognising game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Consider a vertex colouring game played on a simple graph with $k$ permissible colours. Two players, a maker and a breaker, take turns to colour an uncoloured vertex such that adjacent vertices receive different colours.
Dominique Andres, Edwin Lock
doaj +1 more source
F‐purity of binomial edge ideals
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract In 2012, Matsuda introduced the class of weakly closed graphs and investigated when binomial edge ideals are F‐pure. He proved that weakly closed binomial edge ideals are F‐pure whenever the base field has positive characteristic. He conjectured that: (i) when the base field has characteristic 2, every F‐pure binomial edge ideal comes from a ...
Adam LaClair, Jason McCullough
wiley +1 more source
Forbidden subgraphs, stability and hamiltonicity
Discrete Mathematics, 1999 The authors study the stability of some classes of claw-free graphs defined in terms of forbidden subgraphs under the closure operation defined in \textit{Z. Ryjáček} [J. Comb. Theory, Ser. B 70, No.~2, 217-224 (1997; Zbl 0872.05032)]. They characterize all connected graphs \(A\) such that the class of all \(CA\)-free graphs (where \(C\) denotes the ...
Brousek, Jan +2 more
openaire +2 more sources
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
Eigenvalues and forbidden subgraphs I
Linear Algebra and its Applications, 2007 Some calculation errors in the first version are ...
openaire +3 more sources
Rainbow vertex-connection and forbidden subgraphs
Discussiones Mathematicae Graph Theory, 2018 11 ...
Li Wenjing, Li Xueliang, Zhang Jingshu
openaire +4 more sources
Theory and Applications of GraphsA class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G.
Jagdeep Singh +2 more
doaj +1 more source