Results 171 to 180 of about 152,220 (203)

Tutte type theorems for graphs having a perfect internal matching

Information Processing Letters, 2004
Splitters are introduced to capture the meaning of barriers in graphs having a perfect internal matching. The factor-critical property is extended in a natural way to accommodate such graphs, and a characterization of factor-critical graphs is given in the new context.
Miklós Bartha, Miklós Krész
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On the perfect differential of a graph

Quaestiones Mathematicae. Journal of the South African Mathematical Society, 2021
Let G be a graph of order n(G) and vertex set V(G). Given a set S ⊆ V(G), we define the perfect neighbourhood of S as the set Np (S) of all vertices in V(G)\S having exactly one neighbour in S. The perfect differential of S is defined to be ∂p (S) = |Np (
A. Cabrera Martínez, J. A. Rodríguez-Velázquez   +1 more
semanticscholar   +1 more source

Perfect Graph Modification Problems: An Integer Programming Approach

arXiv.org
Graph modification problems, which aim to find a small set of modifications to a graph so that it satisfies a desired property, have been studied for several special graph classes.
Burak Nur Erdem, T. Ekim, Zeki Caner Tacskin   +2 more
semanticscholar   +1 more source

Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity

Embedded Systems and Applications
Petersen's theorem, one of the earliest results in graph theory, states that any bridgeless cubic multigraph contains a perfect matching. While the original proof was neither constructive nor algorithmic, Biedl, Bose, Demaine, and Lubiw [J. Algorithms 38(
Paweł Gawrychowski, Mateusz Wasylkiewicz   +1 more
semanticscholar   +1 more source

Perfect colourings of hypergraphs

Linear and multilinear algebra
Perfect colourings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colourings for hypergraphs ...
A. A. Taranenko
semanticscholar   +1 more source

Dirac's Theorem for Linear Hypergraphs

SIAM Journal on Discrete Mathematics
Dirac's theorem states that any $n$-vertex graph $G$ with even integer $n$ satisfying $\delta(G) \geq n/2$ contains a perfect matching. We generalize this to $k$-uniform linear hypergraphs by proving the following.
Seonghyuk Im, Hyunwoo Lee
semanticscholar   +1 more source

A note on: ``A generalization of the perfect graph theorem under the disjunctive index'' by N. E. Aguilera, M. S. Escalante and G. L. Nasini.

Summary: We give short elementary proofs of two results by \textit{N. E. Aguilera, M. S. Escalante}, and \textit{G. L. Nasini} [Math. Oper. Res. 27, 460--469 (2002; Zbl 1083.05505)] on the disjunctive index of the clique relaxation of the stable set polytope.
Gerards, A. M. H., Maróti, Gábor, Schrijver, Alexander   +2 more
openaire   +1 more source

Fundamentals and developments in fluorescence-guided cancer surgery

Nature Reviews Clinical Oncology, 2021
Aimen Zlitni, Merlijn Hutteman, Jacobus Burggraaf   +2 more
exaly  

A guide to comprehensive phosphor discovery for solid-state lighting

Nature Reviews Materials, 2023
Shruti Hariyani, Małgorzata Sójka, Jakoah Brgoch   +2 more
exaly  

Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators

Nature Machine Intelligence, 2021
Lu Lu, Pengzhan Jin, Guofei Pang
exaly