Results 101 to 110 of about 59,275 (246)
Theory and Applications of GraphsA class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G.
Jagdeep Singh +2 more
doaj +1 more source
Assigning airport ground handling operations: a data‐driven matheuristic
International Transactions in Operational Research, Volume 33, Issue 1, Page 359-383, January 2026.Abstract In this paper, we study a problem in the crossover between vehicle routing and scheduling problems. The multi‐trip capacitated vehicle routing and scheduling problem with time windows and meal breaks is extended to a heterogeneous fleet of trucks and drivers, with qualifications and different loading patterns.
Alexandre Dupaquis +5 more
wiley +1 more source
Characterizing the forbidden pairs for graphs to be super-edge-connected
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text].
Hazhe Ye, Yingzhi Tian
doaj +1 more source
Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs [PDF]
Telfor Journal, 2009 In this paper, we present an approach to search result clustering, using partitioning of underlying link graph. We define the notion of "query-induced subgraph" and formulate the problem of search result clustering as a problem of efficient partitioning ...
A. Bradic
doaj
Completing Partial k‐Star Designs
Journal of Combinatorial Designs, Volume 33, Issue 12, Page 446-455, December 2025.ABSTRACT A k‐star is a complete bipartite graph K 1 , k. A partial k‐star design of order n is a pair ( V , A ) where V is a set of n vertices and A is a set of edge‐disjoint k‐stars whose vertex sets are subsets of V. If each edge of the complete graph with vertex set V is in some star in A, then ( V , A ) is a (complete) k‐star design.
Ajani De Vas Gunasekara, Daniel Horsley
wiley +1 more source
Journal of Graph Theory, Volume 110, Issue 4, Page 448-456, December 2025.ABSTRACT A dominating K t‐model in a graph G is a sequence ( T 1 , … , T t ) of pairwise disjoint non‐empty connected subgraphs of G, such that for 1 ⩽ i < j ⩽ t every vertex in T j has a neighbour in T i. Replacing ‘every vertex in T j’ by ‘some vertex in T j’ retrieves the standard definition of K t‐model, which is equivalent to K t being a minor of ...
Freddie Illingworth, David R. Wood
wiley +1 more source
Outer independent total double Italian domination number [PDF]
Computer Science Journal of MoldovaIf $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ satisfying (i) $f(N[u])\ge 3 ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +1 more source
Line Graphs and Forbidden Induced Subgraphs
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Jian Lai, Lubomír Soltés
openaire +2 more sources
Face Sizes and the Connectivity of the Dual
Journal of Graph Theory, Volume 110, Issue 4, Page 379-391, December 2025.ABSTRACT For each c ≥ 1, we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of c‐connected maps. Using these bounds, we determine the smallest genus on which a c‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a c‐connected map can ...
Gunnar Brinkmann +2 more
wiley +1 more source
On 3-Colorings of Direct Products of Graphs
Discussiones Mathematicae Graph Theory, 2019 The k-independence number of a graph G, denoted as αk(G), is the order of a largest induced k-colorable subgraph of G. In [S. Špacapan, The k-independence number of direct products of graphs, European J. Combin.
Špacapan Simon
doaj +1 more source