Results 41 to 50 of about 6,576,413 (265)
Edge erasures and chordal graphs
Electronic Journal of Graph Theory and Applications, 2021 We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph.
Jared Culbertson +2 more
doaj +1 more source
Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem
Theory and Applications of Graphs, 2017 An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n ...
Matt Noble +3 more
doaj +1 more source
Partitioning graphs into induced subgraphs [PDF]
Discrete Applied Mathematics, 2017 Comment: 14 pages, 4 ...
openaire +2 more sources
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems [PDF]
, 2012 The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem Π, an optimal solution OPT for Π in I and an instance I′ resulting from a local perturbation of I that consists of insertions or removals of a
B. Escoffier +14 more
core +1 more source
A note on the generator subgraph of a graph
Electronic Journal of Graph Theory and Applications, 2020 Graphs considered in this paper are finite simple undirected graphs. Let G = (V(G), E(G)) be a graph with E(G) = {e1, e2,..., em}, for some positive integer m. The edge space of G, denoted by ℰ(G), is a vector space over the field ℤ2. The elements of ℰ(
Neil Mores Mame +1 more
doaj +1 more source
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
, 2013 Bedrossian characterized all pairs of forbidden subgraphs for a 2-connected graph to be Hamiltonian. Instead of forbidding some induced subgraphs, we relax the conditions for graphs to be Hamiltonian by restricting Ore- and Fan-type degree conditions on ...
Bedrossian +13 more
core +1 more source
Finding Induced Subgraphs via Minimal Triangulations [PDF]
, 2009 Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulations problems including Minimum Fill-in and Treewidth.
Fomin, Fedor V., Villanger, Yngve
core +6 more sources
Graphs with distinguishing sets of size k
Kuwait Journal of ScienceThe size of a resolving set R of a non-trivial connected graph Γ of order n ≥ 2 is the number of edges in the induced subgraph .The minimum cardinality of a resolving set of size k of graph Γ is called the metric dimension of size k, denoted by β(k)(Γ ...
Muhammad Naeem Azhar +3 more
doaj +1 more source
Forbidden subgraph pairs for traceability of block-chains
Electronic Journal of Graph Theory and Applications, 2013 A block-chain is a graph whose block graph is a path, i.e. it is either a $P_1$, a $P_2$, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable if it contains a Hamilton path.
Binlong Li +2 more
doaj +1 more source
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
, 2014 In this paper, we address the problem of enumerating all induced subtrees in an input k-degenerate graph, where an induced subtree is an acyclic and connected induced subgraph.
A Shioura +7 more
core +1 more source