Results 161 to 170 of about 5,057 (262)
Журнал Белорусского государственного университета: Математика, информатика, 2018 Let Lm(k) denote the class of edge intersection graphs of k-chromatic hypergraphs with multiplicity at most m. It is known that the problem of recognizing graphs from L1(k) is polynomially solvable if k = 2 and is NP-complete if k = 3.
Tatiana V. Lubasheva, Yury M. Metelsky
doaj
AI Magazine, Volume 47, Issue 2, Summer 2026.Abstract The exponential growth of scientific literature—over 2.5 million papers and 3.5 million patents annually—poses critical challenges for knowledge discovery. To address these, we propose SCIMKG (Scientific Knowledge Graph), a framework for constructing scientific knowledge graphs via multi‐source heterogeneous multi‐source.
Erxi Zhu, Yuan Hu
wiley +1 more source
Maximum k-regular induced subgraphs
Independent sets, induced matchings and cliques are examples of regular induced subgraphs in a graph. In this paper, we prove that finding a maximum cardinality k-regular induced subgraph is an NP-hard problem for any fixed value of k.
Cardoso, Domingos M. +2 more
core
Energy Science &Engineering, Volume 14, Issue 6, Page 2941-2960, June 2026.Interpretable tree‐based models integrate microseismic, geological, and mining indicators to predict short‐term rockburst risk. SHAP analysis reveals the dominant role of energy‐related features and clarifies nonlinear factor interactions, enabling transparent and reliable early‐warning in deep coal mines.
Shuai Chen +4 more
wiley +1 more source
Foreshadowing the Grid Theorem for Induced Subgraphs
We prove several dichotomy theorems toward a complete description of the unavoidable induced subgraphs of graphs with large treewidth. This is motivated by the Grid Theorem of Robertson and Seymour (1986) which achieves the same goal for minors (and ...
Hajebi, Sepehr
core
Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs
Journal of Graph Theory, Volume 112, Issue 2, Page 37-53, June 2026.ABSTRACT Let G n , n c denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n vertices, that is, in which every edge is assigned a color. A cycle C in G n , n c is called properly colored if any two consecutive edges of C have distinct colors.
Tingting Han +3 more
wiley +1 more source
The complete subgraphs of some graphs induced by rings
, 2007 We consider complete subgraphs of the graph induced by the noncommutativity of a ring, and prove that the graph induced by an infinite noncommutative prime ring contains an infinite complete subgraph.
Tang, Hsiu-mien
core
Domination in 4‐Regular Graphs With No Induced 4‐Cycles
Journal of Graph Theory, Volume 112, Issue 2, Page 62-95, June 2026.ABSTRACT A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S. The domination number of G, denoted by γ ( G ), is the minimum cardinality of a dominating set in G. The 1 3‐conjecture for domination in 4‐regular graphs states that if G is a 4‐regular graph of order n, then γ ( G ) ≤ 1 3 n.
Michael A. Henning, Anders Yeo
wiley +1 more source
AVOIDING RAINBOW INDUCED SUBGRAPHS IN EDGE-COLORINGS
, 2008 Let H be a fixed graph on k vertices. For an edge-coloring c of H, we say that H is rainbow, or totally multicolored if c assigns distinct colors to all edges of H. We show, that it is easy to avoid rainbow induced graphs H.
Maria Axenovich, Chelsea Sackett
core
Another Proof of the Generalized Tutte—Berge Formula for f‐Bounded Subgraphs
Journal of Graph Theory, Volume 112, Issue 2, Page 145-150, June 2026.ABSTRACT Given a nonnegative integer weight f ( v ) for each vertex v in a multigraph G, an f‐bounded subgraph of G is a multigraph H contained in G such that d H ( v ) ≤ f ( v ) for all v ∈ V ( G ). Using Tutte's f‐Factor Theorem, we give a new proof of the min–max relation for the maximum size of an f‐bounded subgraph of G. When f ( v ) = 1 for all v,
Zishen Qu, Douglas B. West
wiley +1 more source