Results 51 to 60 of about 975,712 (248)
Quasipolynomiality of the Smallest Missing Induced Subgraph
Journal of Graph Algorithms and Applications, 2023 We study the problem of finding the smallest graph that does not occur as an induced subgraph of a given graph. This missing induced subgraph has at most logarithmic size and can be found by a brute-force search, in an $n$-vertex graph, in time $n^{O ...
David Eppstein +2 more
doaj +1 more source
Posets and planar graphs [PDF]
Journal of Graph Theory, 2005 AbstractUsually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [t − 1 ↕ t], thought to be between t − 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most [2↕3].
Stefan Felsner, William T. Trotter
openaire +1 more source
Planar Graph Classifier - Class Information
, 2022 CSV files associating image files from the Planar Graph Classifier - Generated Graph Images (10.5281/zenodo.6510092) with planarity information.
Hummel, Matthias
core +1 more source
In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols
FEBS Open Bio, EarlyView.Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton +6 more
wiley +1 more source
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
Journal of Graph Algorithms and Applications, 2014 A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp.
William Evans +4 more
doaj +1 more source
Planar lattices and planar graphs
Journal of Combinatorial Theory, Series B, 1976 AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
openaire +2 more sources
Computing Planarity in Computable Planar Graphs
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire +3 more sources
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
FEBS Open Bio, EarlyView.The PAM pathway and its impact on cellular metabolism. Color‐coded key symbols represent Rapamycin (R, orange, targeting mTOR) and Dactolisib (D, green, targeting PI3K/mTOR), indicating their sites of action. Created with BioRenders.com. Glioblastoma resists therapy through interconnected survival programs.
Kai Zhao +23 more
wiley +1 more source
Multilayer Drawings of Clustered Graphs
Journal of Graph Algorithms and Applications, 2014 The cluster adjacency graph of a flat clustered graph C(G,T) is the graph A whose vertices are the clusters in T and whose edges connect clusters containing vertices that are adjacent in G.
Fabrizio Frati
doaj +1 more source