Results 131 to 140 of about 27,298 (312)

Linear Versus Centred Colouring via Pseudogrids

Journal of Graph Theory, EarlyView.
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose, Vida Dujmović, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin   +4 more
wiley   +1 more source

Distributed Subgraph Matching on Big Knowledge Graphs Using Pregel

IEEE Access, 2019
With RDF becoming the de facto standard for representing knowledge graphs, it is indispensable to develop scalable subgraph matching algorithms over big RDF graphs stored in distributed clusters.
Qiang Xu, Xin Wang, Jianxin Li, Qingpeng Zhang, Lele Chai   +4 more
doaj   +1 more source

Ascending subgraph decomposition

Journal of Combinatorial Theory, Series B
A typical theme for many well-known decomposition problems is to show that some obvious necessary conditions for decomposing a graph $G$ into copies $H_1, \ldots, H_m$ are also sufficient. One such problem was posed in 1987, by Alavi, Boals, Chartrand, Erdős, and Oellerman. They conjectured that the edges of every graph with $\binom{m+1}2$ edges can be
Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy, Benny Sudakov   +3 more
openaire   +3 more sources

Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley   +1 more source

Colorful induced subgraphs

Discrete Mathematics, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hal A. Kierstead, William T. Trotter
openaire   +2 more sources

Subgraph classification through neighborhood pooling

, 2023
Subgraph classification is an emerging field in graph representation learning where the task is to classify a group of nodes (i.e., a subgraph) within a graph.
Jacob, Shweta Ann
core  

Planar Subgraph Isomorphism Revisited [PDF]

, 2010
The problem of {\sc Subgraph Isomorphism} is defined as follows: Given a \emph{pattern} $H$ and a \emph{host graph} $G$ on $n$ vertices, does $G$ contain a subgraph that is isomorphic to $H$?
Dorn, Frederic
core   +1 more source

An End Degree for Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this paper we define a degree for ends of infinite digraphs. The well‐definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree.
Matthias Hamann, Karl Heuer
wiley   +1 more source

Bounds for b-chromatic number of subgraphs and edge-deleted subgraphs

Discussiones Mathematicae Graph Theory, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Francis, S. Francis Raj
openaire   +3 more sources

On Fork‐Free t‐Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source