Results 1 to 10 of about 842 (102)
On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 We consider the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments. We prove that for every simple digraph $H$, $k\in \mathbb{N}$, and tournament $T$, the following statements hold: (i) If in $T$ one cannot find $k$ arc ...
Łukasz Bożyk, Michał Pilipczuk
doaj +1 more source
Labeled Packing of Cycles and Circuits
Discussiones Mathematicae Graph Theory, 2022 In 2013, Duchçne, Kheddouci, Nowakowski and Tahraoui introduced a labeled version of the graph packing problem. It led to the introduction of a new graph parameter, the k-packing label-span λk.
Joffard Alice, Kheddouci Hamamache
doaj +1 more source
Supermagic Graphs with Many Different Degrees
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f from the set of edges E to a set of consecutive integers {a, a + 1, . . .
Kovář Petr +3 more
doaj +1 more source
Correlations in totally symmetric self‐complementary plane partitions
Transactions of the London Mathematical Society, Volume 8, Issue 1, Page 493-526, December 2021., 2021 Abstract Totally symmetric self‐complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well‐known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in 1/12 of a hexagon with free boundary to express them as perfect matchings of a family of non‐bipartite planar graphs ...
Arvind Ayyer, Sunil Chhita
wiley +1 more source
Minimum Coverings of Crowns with Cycles and Stars
Discussiones Mathematicae Graph Theory, 2022 Let F, G and H be graphs. A (G, H)-decomposition of F is a partition of the edge set of F into copies of G and copies of H with at least one copy of G and at least one copy of H.
Lin Jenq-Jong, Jou Min-Jen
doaj +1 more source
Tuza's Conjecture for Threshold Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph. The conjecture holds for graphs with small treewidth or small maximum average degree, including
Marthe Bonamy +6 more
doaj +1 more source
On Hamiltonian Cycles in Claw-Free Cubic Graphs
Discussiones Mathematicae Graph Theory, 2022 We show that every claw-free cubic graph of order n at least 8 has at most 2⌊n4⌋{2^{\left\lfloor {{n \over 4}} \right\rfloor }} Hamiltonian cycles, and we also characterize all extremal graphs.
Mohr Elena, Rautenbach Dieter
doaj +1 more source
Graphs with Unique Maximum Packing of Closed Neighborhoods
Discussiones Mathematicae Graph Theory, 2022 A packing of a graph G is a subset P of the vertex set of G such that the closed neighborhoods of any two distinct vertices of P do not intersect. We study graphs with a unique packing of the maximum cardinality. We present several general properties for
Božović Dragana, Peterin Iztok
doaj +1 more source
Ascending Subgraph Decompositions of Oriented Graphs that Factor into Triangles
Discussiones Mathematicae Graph Theory, 2022 In 1987, Alavi, Boals, Chartrand, Erdős, and Oellermann conjectured that all graphs have an ascending subgraph decomposition (ASD). In a previous paper, Wagner showed that all oriented complete balanced tripartite graphs have an ASD.
Austin Andrea D., Wagner Brian C.
doaj +1 more source
Hitting minors, subdivisions, and immersions in tournaments [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The Erd\H{o}s-P\'osa property relates parameters of covering and packing of combinatorial structures and has been mostly studied in the setting of undirected graphs.
Jean-Florent Raymond
doaj +1 more source