Results 121 to 130 of about 10,864 (212)
Forbidden subgraphs for graphs with planar line graphs
, 1972 D. L. Greenwell, Robert L. Hemminger
openalex +1 more source
Журнал Белорусского государственного университета: Математика, информатика, 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
On the chromatic number of a graph with two forbidden subgraphs
, 1989 Medha Dhurandhar
openalex +1 more source
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Algorithms Mol Biol, 2023 Marchand B +4 more
europepmc +1 more source
On vertex Ramsey graphs with forbidden subgraphs
Discrete MathematicsOne ...
Diskin, Sahar +3 more
openaire +2 more sources
On maximum spectral radius of {H (3, 3), H (4, 3)}-free graphs [PDF]
Acta Universitatis Sapientiae: InformaticaAmir Rehman, Shariefuddin Pirzada
doaj +1 more source
The forbidden subgraph characterization of directed vertex graphs
, 1999 B. S. Panda
openalex +1 more source
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]
Discrete Comput Geom, 2023 Casel K +4 more
europepmc +1 more source
On Universal Graphs With Forbidden Topological Subgraphs
European Journal of Combinatorics, 1985 If a class G of countable graphs has a member G* that contains a copy of every G ∈ G then G* is called universal in G . If every G ∈ G is isomorphic to an induced subgraph of G* we call G* strongly universal in G . By determining for which n, m ∈ ℕ the class G (TKn,m) of all countable graphs with forbidden subdivisions of Kn,m has a (strongly ...
openaire +2 more sources
Genetic networks encode secrets of their past. [PDF]
J Theor Biol, 2022 Crawford-Kahrl P +3 more
europepmc +1 more source