Results 61 to 70 of about 1,022,735 (236)
Immersion containment and connectivity in color-critical graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Faisal N. Abu-Khzam, Michael A. Langston
doaj +1 more source
On 4-colorable robust critical graphs [PDF]
Discrete Mathematics Letters, 2021 Mark Anderson +4 more
doaj +1 more source
Critical random graphs: Diameter and mixing time
, 2008 Let $\mathcal{C}_1$ denote the largest connected component of the critical Erd\H{o}s--R\'{e}nyi random graph $G(n,{\frac{1}{n}})$. We show that, typically, the diameter of $\mathcal{C}_1$ is of order $n^{1/3}$ and the mixing time of the lazy simple ...
Nachmias, Asaf, Peres, Yuval
core +1 more source
The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices
Discussiones Mathematicae Graph Theory, 2014 An edge of a graph is called dot-critical if its contraction decreases the domination number. A graph is said to be dot-critical if all of its edges are dot-critical. A vertex of a graph is called critical if its deletion decreases the domination number.
Furuya Michitaka
doaj +1 more source
Edge-Stable Equimatchable Graphs
, 2018 A graph $G$ is \emph{equimatchable} if every maximal matching of $G$ has the same cardinality. We are interested in equimatchable graphs such that the removal of any edge from the graph preserves the equimatchability.
Deniz, Zakir, Ekim, Tınaz
core +1 more source
Electronic Notes in Discrete Mathematics, 2008 Abstract In this paper we introduce the concept of k-flow-critical graphs. These are graphs that do not admit a k-flow but such that any smaller graph obtained from it by contraction of edges or of pairs of vertices is k-flowable. Any minimal counter-example for Tutte's 3-Flow and 5-Flow Conjectures must be 3-flow-critical and 5-flow-critical ...
Cândida Nunes da Silva +1 more
openaire +1 more source
Game total domination critical graphs [PDF]
Discrete Applied Mathematics, 2018 In the total domination game played on a graph $G$, players Dominator and Staller alternately select vertices of $G$, as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller) wishes to minimize (maximize) the number of vertices selected. The game total domination number, $ _{\rm tg}(G)$,
Henning, Michael A. +2 more
openaire +2 more sources
Comparison of Swendsen-Wang and Heat-Bath Dynamics
, 2013 We prove that the spectral gap of the Swendsen-Wang process for the Potts model on graphs with bounded degree is bounded from below by some constant times the spectral gap of any single-spin dynamics.
Alexander +19 more
core +1 more source
Critically indecomposable graphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dubey, Chandan K., Mehta, Shashank K.
openaire +1 more source
Critical graphs in index coding [PDF]
2014 IEEE International Symposium on Information Theory, 2014 In this paper we define critical graphs as minimal graphs that support a given set of rates for the index coding problem, and study them for both the one-shot and asymptotic setups. For the case of equal rates, we find the critical graph with minimum number of edges for both one-shot and asymptotic cases. For the general case of possibly distinct rates,
Tahmasbi, Mehrdad +2 more
openaire +3 more sources