Results 11 to 20 of about 142,988 (312)
Cyclability in Graph Classes [PDF]
, 2019 A subset T subseteq V(G) of vertices of a graph G is said to be cyclable if G has a cycle C containing every vertex of T, and for a positive integer k, a graph G is k-cyclable if every subset of vertices of G of size at most k is cyclable.
Crespelle, Christophe Dominique +4 more
core +5 more sources
On graph isomorphism for restricted graph classes [PDF]
, 2006 Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t be solved by classifying it as being either NP-complete or solvable in P.
Johannes Köbler
core +2 more sources
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 +3 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
On a Class of Semigroup Graphs
Advances in Pure Mathematics, 2023 16pages ...
Chen, Li, Wu, Tongsuo
openaire +2 more sources
Discrete Applied Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christophe Crespelle, Petr A. Golovach
openaire +4 more sources
Long-Tailed Graph Representation Learning via Dual Cost-Sensitive Graph Convolutional Network
Remote Sensing, 2022 Deep learning algorithms have seen a massive rise in popularity for remote sensing over the past few years. Recently, studies on applying deep learning techniques to graph data in remote sensing (e.g., public transport networks) have been conducted.
Yijun Duan +6 more
doaj +1 more source
Decomposition of class II graphs into two class I graphs
Discrete Mathematics, 2023 Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum $Δ$-edge-colorable subgraph and a matching. They further conjectured that every graph $G$ with chromatic index $Δ(G)+k$ ($k\geq 1$) can be decomposed into a maximum $Δ(G)$-edge-colorable subgraph (not necessarily ...
Yan Cao 0001 +5 more
openaire +3 more sources
On equitable near-proper coloring of some derived graph classes
Karpatsʹkì Matematičnì Publìkacìï, 2022 An equitable near-proper coloring of a graph $G$ is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimized by restricting the number of color classes that can have ...
S. Jose, S. Naduvath
doaj +1 more source