Results 11 to 20 of about 152,220 (203)
An Ore-type Theorem for Perfect Packings in Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2009 23 pages, 1 figure. Extra examples and a sketch proof of Theorem 4 added.
Daniela Kühn +2 more
core +8 more sources
Perfect Matching in Random Graphs is as Hard as Tseitin [PDF]
TheoretiCS, 2022 We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times.
Per Austrin, Kilian Risse
doaj +3 more sources
An Even 2-Factor in the Line Graph of a Cubic Graph
Theory and Applications of Graphs, 2022 An even 2-factor is one such that each cycle is of even length. A 4- regular graph G is 4-edge-colorable if and only if G has two edge-disjoint even 2- factors whose union contains all edges in G.
SeungJae Eom, Kenta Ozeki
doaj +2 more sources
Two short proofs of the Perfect Forest Theorem [PDF]
Theory and Applications of Graphs, 2017 A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest.
Yair Caro, Josef Lauri, Christina Zarb
doaj +2 more sources
Electronic Journal of Graph Theory and Applications, 2017 In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degree-matchings and next investigate some of their properties.
Radosław Cymer
doaj +3 more sources
A Complementation Theorem for Perfect Matchings of Graphs Having a Cellular Completion
Journal of Combinatorial Theory, Series A, 1998 A graph whose edges can be partitioned into 4-cycles in such a way that each vertex is contained in at most two 4-cycles is called a cellular graph. The author gives a ``complementation theorem'' for enumerating the matchings of certain subgraphs of cellular graphs.
Mihai Ciucu
openaire +3 more sources
The Flat Wall Theorem for Bipartite Graphs with Perfect Matchings
, 2021 Matching minors are a specialised version of minors fit for the study of graphs with perfect matchings. The first major appearance of matching minors was in a result by Little who showed that a bipartite graph is Pfaffian if and only if it does not contain \(K_{3,3}\) as a matching minor.
Sebastian Wiederrecht +1 more
+6 more sources
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
Discrete Mathematics, 1986 An R-digraph (also called kernel-perfect graph) is a digraph such that all of its induced subdigraphs possess a kernel (that is an independent dominating subset). Meyniel's conjecture (suggested in the title) is that D is an R-digraph if all odd directed cycles of D possess two pseudodiagonals (a pseudo-diagonal is an arc which is not part of the cycle
Hortensia Galeana‐Sánchez
openaire +3 more sources
Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints [PDF]
International Joint Conference on Artificial Intelligence, 2023 Determining the satisfiability of Boolean constraint-satisfaction problems with different types of constraints, that is hybrid constraints, is a well-studied problem with important applications.
Moshe Y. Vardi, Zhiwei Zhang
semanticscholar +1 more source
Arkhipov’s theorem, graph minors, and linear system nonlocal games [PDF]
Algebraic Combinatorics, 2022 The perfect quantum strategies of a linear system game correspond to certain representations of its solution group. We study the solution groups of graph incidence games, which are linear system games in which the underlying linear system is the ...
Connor Paddock +3 more
semanticscholar +1 more source