Results 11 to 20 of about 69,865 (208)
The Ryjáček Closure and a Forbidden Subgraph [PDF]
Discussiones Mathematicae Graph Theory, 2016 The Ryjáček closure is a powerful tool in the study of Hamiltonian properties of claw-free graphs. Because of its usefulness, we may hope to use it in the classes of graphs defined by another forbidden subgraph. In this note, we give a negative answer to
Saito Akira, Xiong Liming
doaj +4 more sources
Toughness, Forbidden Subgraphs and Pancyclicity [PDF]
Graphs and Combinatorics, 2021 AbstractMotivated by several conjectures due to Nikoghosyan, in a recent article due to Li et al., the aim was to characterize all possible graphs H such that every 1-tough H-free graph is hamiltonian. The almost complete answer was given there by the conclusion that every proper induced subgraph H of $$K_1\cup P_4$$
Wei Zheng 0008 +2 more
openaire +4 more sources
Forbidden Subgraph Problems with Predictions [PDF]
CoRRIn the Online Delayed Connected H-Node-Deletion Problem, an unweighted graph is revealed vertex by vertex and it must remain free of any induced copies of a specific connected induced forbidden subgraph H at each point in time. To achieve this, an algorithm must, upon each occurrence of H, identify and irrevocably delete one or more vertices.
Hans-Joachim Böckenhauer +3 more
core +4 more sources
The Largest Subgraph Without A Forbidden Induced Subgraph [PDF]
Combinatorica20 ...
Fox, Jacob +2 more
core +5 more sources
Forbidden subgraphs and the König–Egerváry property [PDF]
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Flavia Bonomo +5 more
openaire +8 more sources
Small bipartite subgraph polytopes [PDF]
, 2010 We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes.
Galli, L, Letchford, A N
core +5 more sources
Splits with forbidden subgraphs [PDF]
Discrete Mathematics, 2022 In this note, we fix a graph $H$ and ask into how many vertices can each vertex of a clique of size $n$ can be "split" such that the resulting graph is $H$-free. Formally: A graph is an $(n,k)$-graph if its vertex sets is a pairwise disjoint union of $n$ parts of size at most $k$ each such that there is an edge between any two distinct parts. Let $$ f(
Maria Axenovich, Ryan R. Martin
openaire +3 more sources
Forbidden Subgraphs of Power Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are connected by an edge between if and only if either $u=v^i$ or $v=u^j$ for some $i$, $j$.
Pallabi Manna +2 more
openaire +6 more sources
Pattern matching and pattern discovery algorithms for protein topologies [PDF]
, 2001 We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted ...
Viksna, J, Gilbert, D
core +7 more sources
On minimal forbidden subgraph characterizations of balanced graphs [PDF]
, 2013 Artículo de publicación ISIA graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix.
Safe, Martín D. +9 more
core +2 more sources