Results 31 to 40 of about 152,220 (203)
Planar cycle-extendable graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi +3 more
doaj +1 more source
Transitive Triangle Tilings in Oriented Graphs [PDF]
, 2017 In this paper, we prove an analogue of Corr\'adi and Hajnal's classical theorem. There exists $n_0$ such that for every $n \in 3\mathbb{Z}$ when $n \ge n_0$ the following holds.
Balogh, József +2 more
core +2 more sources
A Multipartite Hajnal-Szemer\'edi Theorem [PDF]
, 2015 The celebrated Hajnal-Szemer\'edi theorem gives the precise minimum degree threshold that forces a graph to contain a perfect K_k-packing. Fischer's conjecture states that the analogous result holds for all multipartite graphs except for those formed by ...
Catlin +9 more
core +2 more sources
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem [PDF]
ACM Trans. Algorithms, 2017 Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurović et al. (IEEE TCBB, 2018) introduced the minimum conflict-free row split (MCRS) problem: split each row of a given binary matrix into ...
Ademir Hujdurović +4 more
semanticscholar +1 more source
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions [PDF]
, 2016 Inspired by a question of Yannakakis on the Vertex Packing polytope of perfect graphs, we study the Clique-Stable Set Separation in a non-hereditary subclass of perfect graphs.
Lagoutte, Aurélie, Trunck, Théophile
core +4 more sources
An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings [PDF]
Ars Math. Contemp., 2015 In this paper we give a proof that the largest set of perfect matchings, in which any two contain a common edge, is the set of all perfect matchings that contain a fixed edge.
C. Godsil, Karen Meagher
semanticscholar +1 more source
Perfectly contractile diamond‐free graphs [PDF]
Journal of Graph Theory, 1999 4 pages, no ...
Thomas Böhme +2 more
openaire +21 more sources
Constant 2-Labellings And An Application To (R, A, B)-Covering Codes
Discussiones Mathematicae Graph Theory, 2017 We introduce the concept of constant 2-labelling of a vertex-weighted graph and show how it can be used to obtain perfect weighted coverings. Roughly speaking, a constant 2-labelling of a vertex-weighted graph is a black and white colouring of its vertex
Gravier Sylvain, Vandomme Èlise
doaj +1 more source
On Perfectness of Intersection Graph of Ideals of ℤn
Discussiones Mathematicae - General Algebra and Applications, 2017 In this short paper, we characterize the positive integers n for which intersection graph of ideals of ℤn is perfect.
Das Angsuman
doaj +1 more source
The fullerene graphs with a perfect star packing
Ars Math. Contemp., 2022 Fullerene graph G is a connected plane cubic graph with only pentagonal and hexagonal faces, which is the molecular graph of carbon fullerene. A spanning subgraph of G is called a perfect star packing in G if its each component is isomorphic to K1,3. For
Lingjuan Shi
semanticscholar +1 more source