Results 41 to 50 of about 39,621 (255)
Journal of Combinatorial Theory, Series B, 1996 The main result of this series serves to reduce several problems about general graphs to problems about graphs which can “almost” be drawn in surfaces of bounded genus. In applications of the theorem we usually need to encode such a nearly embedded graph as a hypergraph which can be drawn completely in the surface.
Robertson, Neil, Seymour, P.D
openaire +1 more source
On graph contractions and induced minors [PDF]
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pim van 't Hof +4 more
openaire +4 more sources
Stack and Queue Layouts via Layered Separators
, 2016 It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not ...
ED Demaine +15 more
core +1 more source
On the extension complexity of combinatorial polytopes [PDF]
, 2013 In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete problems including ...
Avis, David, Tiwary, Hans Raj
core +1 more source
Molecular Oncology, EarlyView.Pharmacologic ascorbate (vitamin C) increases ROS, disrupts cellular metabolism, and induces DNA damage in CRPC cells. These effects sensitize tumors to PARP inhibition, producing synergistic growth suppression with olaparib in vitro and significantly delayed tumor progression in vivo. Pyruvate rescue confirms ROS‐dependent activity.
Nicolas Gordon +13 more
wiley +1 more source
A unified view on bipartite species-reaction and interaction graphs for chemical reaction networks [PDF]
, 2012 The Jacobian matrix of a dynamic system and its principal minors play a prominent role in the study of qualitative dynamics and bifurcation analysis.
Kaltenbach, Hans-Michael
core
Clique Minors in Graphs and Their Complements
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruce A. Reed, Robin Thomas 0001
openaire +1 more source
On the geometry of graphs with a forbidden minor [PDF]
Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009 We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture to a pair of manifestly simpler conjectures. The GNRS conjecture characterizes all graphs that have an O(1)-approximate multi-commodity max-flow/min-cut theorem. In particular,
James R. Lee, Anastasios Sidiropoulos
openaire +1 more source
Molecular Oncology, EarlyView.This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns +10 more
wiley +1 more source
A Note on Graphs of Linear Rank-Width 1 [PDF]
, 2013 We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear rank-width at ...
Bui-Xuan, Binh-Minh +2 more
core