Results 21 to 30 of about 9,740 (155)
The graph grabbing game on {0,1}-weighted graphs
Results in Applied Mathematics, 2019 The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +1 more source
Forbidden subgraphs for chorded pancyclicity
Discrete Mathematics, 2017 We call a graph $G$ pancyclic if it contains at least one cycle of every possible length $m$, for $3\le m\le |V(G)|$. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length $4, 5, \ldots, |V(G)|
Megan Cream +2 more
openaire +3 more sources
Hereditary Equality of Domination and Exponential Domination in Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2021 Let γ(G) and γe(G) denote the domination number and exponential domination number of graph G, respectively. Henning et al., in [Hereditary equality of domination and exponential domination, Discuss. Math. Graph Theory 38 (2018) 275–285] gave a conjecture:
Chen Xue-Gang, Wang Yu-Feng, Wu Xiao-Fei
doaj +1 more source
Towards an Isomorphism Dichotomy for Hereditary Graph Classes [PDF]
, 2014 In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs.
Schweitzer, Pascal
core +3 more sources
Colouring graphs with forbidden bipartite subgraphs
Combinatorics, Probability and Computing, 2022 AbstractA conjecture of Alon, Krivelevich and Sudakov states that, for any graph $F$ , there is a constant $c_F \gt 0$ such that if $G$ is an $F$ -free graph of maximum degree $\Delta$ , then $\chi\!(G) \leqslant c_F \Delta/ \log\!\Delta$ . Alon, Krivelevich and Sudakov verified this conjecture for a class of graphs $F$ that includes all ...
James Anderson +2 more
openaire +3 more sources
Graphs that are not pairwise compatible: A new proof technique (extended abstract) [PDF]
, 2018 A graph G = (V,E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dminand dmax, dmin≤ dmax, such that each node u∈V is uniquely associated to a leaf of T and there is an edge (u, v) ∈ E if
Baiocchi, Pierluigi +3 more
core +1 more source
Forbidden subgraphs in connected graphs
Theoretical Computer Science, 2004 Given a set $ξ=\{H_1,H_2,...\}$ of connected non acyclic graphs, a $ξ$-free graph is one which does not contain any member of $% ξ$ as copy. Define the excess of a graph as the difference between its number of edges and its number of vertices. Let ${\gr{W}}_{k,ξ}$ be theexponential generating function (EGF for brief) of connected $ξ$-free graphs of ...
Ravelomanana, Vlady, Loÿs, Thimonier
openaire +3 more sources
Electronic Journal of Graph Theory and Applications, 2018 We find the structure of graphs that have no C4, $\overline{C}_4$, C5, S3, chair and co-chair as induced subgraphs. Then we deduce the structure of the graphs having no induced C4, $\overline{C_4}$, S3, chair and co-chair and the structure of the graphs ...
Salman Ghazal
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2018 We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$.
Michael D. Barrus
doaj +1 more source
On edge-sets of bicliques in graphs [PDF]
, 2012 A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-
Groshaus, Marina +2 more
core +2 more sources