Results 61 to 70 of about 4,035 (167)

Balanced Independent Sets and Colorings of Hypergraphs

Journal of Graph Theory, Volume 109, Issue 1, Page 43-51, May 2025.
ABSTRACT A k ‐uniform hypergraph H = ( V , E ) Abhishek Dhawan
wiley   +1 more source

On the acyclic choosability of graphs [PDF]

Journal of Graph Theory, 2005
AbstractA proper vertex coloring of a graph G =  (V,E) is acyclic if G contains no bicolored cycle. A graph G is L‐list colorable if for a given list assignment L = {L(v): v ∈ V}, there exists a proper coloring c of G such that c (v) ∈ L(v) for all v ∈ V.
Montassier, Mickaël, Ochem, Pascal, Raspaud, André   +2 more
openaire   +5 more sources

State‐of‐the‐art Report in Sketch Processing

Computer Graphics Forum, Volume 44, Issue 2, May 2025.
Abstract Sketches are a powerful and natural form of communication and are used in numerous systems for modelling, animation, shape retrieval, and editing. Despite their popularity, rough sketches — whether raster or vector, 2D or 3D — are often too complex and imprecise to be used directly and thus need special processing.
Chenxi Liu, Mikhail Bessmeltsev
wiley   +1 more source

Color-critical Graphs and Hereditary Hypergraphs

, 2019
A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-set into a minimum number of hyperedges of a hereditary hypergraph, generalizing the chromatic number.
openaire   +2 more sources

Infinite families of 4‐chromatic Grötzsch‐Sachs graphs [PDF]

Journal of Graph Theory, 2008
AbstractLet G be a 4‐regular planar graph and suppose that G has a cycle decomposition S (i.e., each edge of G is in exactly one cycle of the decomposition) with every pair of adjacent edges on a face always in different cycles of S. Such graphs, called Grötzsch‐Sachs graphs, arise as a superposition of simple closed curves in the plane with tangencies
Michael A. Henning, Anders Yeo
openaire   +4 more sources

CFlow: A Novel High‐Order Flow Analysis Unit for Detecting Spatiotemporal Mobility Patterns Based on Origin–Destination Data

Transactions in GIS, Volume 29, Issue 3, May 2025.
ABSTRACT Mobility behavior research has long been a focal point in geographic information science (GIS). Many researchers use isolated OD pairs as flow analysis units when studying mobility behavior based on OD (origin–destination) data. However, isolated OD pairs only reflect individual mobility, which may constrain applying a collective analytical ...
Rui Xin, Kuan Yang, Jian Yang, Tingting Li, Jiaoe Wang   +4 more
wiley   +1 more source

Not All Saturated 3-Forests Are Tight [PDF]

, 2011
A basic statement in graph theory is that every inclusion-maximal forest is connected, i.e. a tree. Using a definiton for higher dimensional forests by Graham and Lovasz and the connectivity-related notion of tightness for hypergraphs introduced by ...
Gebauer, Heidi, Gundert, Anna, Moser, Robin A., Okamoto, Yoshio   +3 more
core  

On the Pre‐ and Post‐Positional Semi‐Random Graph Processes

Journal of Graph Theory, Volume 108, Issue 4, Page 819-831, April 2025.
ABSTRACT We study the semi‐random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi‐random graph G $G$ that has property P ${\mathscr{P}}$, for the following examples of P ${\mathscr{P}}$: (1) P ${\mathscr{P}}$ is the set of graphs containing ...
Pu Gao, Hidde Koerts
wiley   +1 more source

On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning

Networks, Volume 85, Issue 3, Page 261-271, April 2025.
ABSTRACT In this paper we present a new covering problem, called Min Cost q$$ q $$‐Single Location Cover, where we are given a fixed positive integer q$$ q $$, a finite ground set J$$ J $$, an integral positive demand dj$$ {d}_j $$ for each element j∈J$$ j\in J $$, a collection 𝒥 of subsets of J$$ J $$, an integral positive cost cS$$ {c}_S $$ and an ...
Shai Dimant, Sven O. Krumke
wiley   +1 more source

Single‐Cell Hi‐C Technologies and Computational Data Analysis

Advanced Science, Volume 12, Issue 9, March 6, 2025.
This review provides a detailed examination of scHi‐C technologies, offering quantitative evaluations of 13 protocols. It addresses computational challenges arising from data sparsity and presents systematic insights into data analysis methods, including clustering, TAD calling and 3D reconstruction.
Madison A Dautle, Yong Chen
wiley   +1 more source