Results 81 to 90 of about 735 (221)
Complexity Framework for Forbidden Subgraphs
, 2022 For any finite set H={H1,…,Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H1,…,Hp as a subgraph. Similar to known meta-classifications for the minor and topological minor relations, we give a meta-classification for the subgraph relation.
Johnson, Matthew S. +6 more
openaire +2 more sources
Essentially tight bounds for rainbow cycles in proper edge‐colourings
Proceedings of the London Mathematical Society, Volume 130, Issue 4, April 2025.Abstract An edge‐coloured graph is said to be rainbow if no colour appears more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decade as they capture the essence of a number of interesting problems in a variety of areas.
Noga Alon +4 more
wiley +1 more source
Rainbow connection and forbidden subgraphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Holub, Přemysl +3 more
openaire +1 more source
Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II
AKCE International Journal of Graphs and Combinatorics, 2018 Given a graph , not necessarily finite, a graphoidal cover of means a collection of non-trivial paths in called -edges, which are not necessarily open (not necessarily finite), such that every vertex of is an internal vertex of at most one path in and ...
Purnima Gupta, Rajesh Singh
doaj +2 more sources
Complete immersions in graphs with independence number two and small forbidden subgraphs
, 2021 Daniel A. Quiroz
openalex +1 more source
Stability for large forbidden subgraphs [PDF]
Journal of Graph Theory, 2009 AbstractIn this note we strengthen the stability theorem of Erdős and Simonovits. Write Kr(s1, …, sr) for the complete r‐partite graph with classes of sizes s1, …, sr and Tr(n) for the r‐partite Turán graph of order n. Our main result is:For all r≥2 and all sufficiently small c>0, ε>0, every graph G of sufficiently large order n with e(G)>(1−1/
openaire +2 more sources
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
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs.
Fernando Esteban Contreras-Mendoza +1 more
doaj +1 more source
Small clique number graphs with three trivial critical ideals
Special Matrices, 2018 The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. Previously, they have been used in the understanding and characterizing of the graphs with critical group with few invariant factors ...
Alfaro Carlos A., Valencia Carlos E.
doaj +1 more source
The spectral Turán problem about graphs of given size with forbidden subgraphs
AKCE International Journal of Graphs and CombinatoricsLet G be a graph of size m and [Formula: see text] be the spectral radius of its adjacency matrix. A graph is said to be H-free if it does not contain a subgraph isomorphic to H. Let [Formula: see text] be the graph obtained by adding a pendent vertex to
Amir Rehman, S. Pirzada
doaj +1 more source