Results 1 to 10 of about 1,814,953 (245)
Graph Classes Generated by Mycielskians
Discussiones Mathematicae Graph Theory, 2020 In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following sequence: M′0(G) = G, M′1(G) = M′(G), and M′n(G) = M′(M′n−1(G)), to show that if G is a complete graph of order p, then the above sequence is a generator ...
Borowiecki Mieczys law +3 more
doaj +3 more sources
Deletion to scattered graph classes I - Case of finite number of graph classes
Journal of Computer and System Sciences, 2023 An extended abstract of the paper appeared in IPEC 2020. This version has a new co-author Jari J. H. de Kroon and an extension of our main result for the case when forbidden subgraphs of each class can be infinite, under certain other ...
Venkaṭesh Raman +2 more
exaly +3 more sources
Graph classes equivalent to 12-representable graphs
Discussiones Mathematicae Graph Theory12 pages, 6 figures, Corrected typos, Corrected Reference [22]
Asahi Takaoka
doaj +5 more sources
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes [PDF]
Logical Methods in Computer Science, 2023 The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes ...
Jan Dreier
doaj +1 more source
Minimal toughness in special graph classes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Let $t$ be a positive real number. A graph is called $t$-tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components, and all graphs are considered 0-tough. The toughness of a graph is the largest $t$ for which
Gyula Y. Katona, Kitti Varga
doaj +1 more source
Scattered Classes of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 For a class $\mathcal C$ of graphs $G$ equipped with functions $f_G$ defined on subsets of $E(G)$ or $V(G)$, we say that $\mathcal{C}$ is $k$-scattered with respect to $f_G$ if there exists a constant $\ell$ such that for every graph $G\in \mathcal C$, the domain of $f_G$ can be partitioned into subsets of size at most $k$ so that the union of every ...
Kwon, O-joung, Oum, Sang-il
openaire +4 more sources
Transactions of the American Mathematical Society, 1960 We consider even order graphs in which no two points have more than one join and no point is joined to itself. In such a graph G, of order 2n, [A, B] denotes an "equipartition of G" if A and B are subgraphs of G of order n whose vertex sets are disjoint.
Kelly, Paul, Merriell, David
openaire +2 more sources
Information, 2022 We study classes of geometric graphs, which all correspond to the following structural characteristic. For each instance of a vertex set drawn from a universe of possible vertices, each pair of vertices is either required to be connected, forbidden to be
Lucas Böltz, Hannes Frey
doaj +1 more source
On a Class of Semigroup Graphs
Advances in Pure Mathematics, 2023 16pages ...
Chen, Li, Wu, Tongsuo
openaire +2 more sources