Results 131 to 140 of about 5,057 (262)
Informatika, 2018 A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj
Discussiones Mathematicae Graph Theory, 2017 We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury +2 more
doaj +1 more source
Total graph of a module with respect to singular submodule
Arab Journal of Mathematical Sciences, 2016 Let R be a commutative ring with unity and M be an R-module. We introduce the total graph of a module M with respect to singular submodule Z(M) of M as an undirected graph T(Γ(M)) with vertex set as M and any two distinct vertices x and y are adjacent if
Jituparna Goswami +2 more
doaj +1 more source
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source
Random induced subgraphs of Cayley graphs induced by transpositions
, 2011 In this paper we study random induced subgraphs of Cayley graphs of the symmetric group induced by an arbitrary minimal generating set of transpositions.
Jin, Emma Yu +5 more
core +1 more source
On induced subgraphs with odd degrees
Discrete Mathematics, 1994 The author proves that every graph \(G\) on \(n\) vertices with no isolated vertices contains an induced subgraph \(H\) such that every vertex in \(H\) has odd degree in \(H\) and \(| V(H) | \geq (1-o(1))\sqrt {n/6}\).
openaire +2 more sources
Tight Bounds for Hypercube Minor‐Universality
Journal of Graph Theory, Volume 112, Issue 4, Page 433-437, August 2026.ABSTRACT A graph G is m‐minor‐universal if every graph H with at most m edges and no isolated vertices is contained as a minor in G. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c > 0 such that the d‐dimensional hypercube Q d is ( c ⋅ 2 d / d)‐minor‐universal, while there is an absolute constant K > 0 such that Q d ...
Emma Hogan +5 more
wiley +1 more source
An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth
Journal of Graph Theory, Volume 112, Issue 4, Page 409-420, August 2026.ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth k admit a partition with ‘local,
Marc Distel
wiley +1 more source
On Hereditary Helly classes of graphs
Discrete Mathematics & Theoretical Computer Science, 2008 In graph theory, the Helly property has been applied to families of sets, such as cliques, disks, bicliques, and neighbourhoods, leading to the classes of clique-Helly, disk-Helly, biclique-Helly, neighbourhood-Helly graphs, respectively.
Marina Groshaus, Jayme Luiz Szwarcfiter
doaj
Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets [PDF]
Discrete Mathematics Letters, 2021 Vladimir Samodivkin
doaj +1 more source