Results 51 to 60 of about 842,486 (276)
Claw-free graphs. III. Circular interval graphs
Journal of Combinatorial Theory, Series B, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chudnovsky, Maria, Seymour, Paul
openaire +2 more sources
Exact Algorithms for Intervalizing Colored Graphs [PDF]
Theory of Computing Systems, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bodlaender, Hans L. +1 more
openaire +6 more sources
Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin
Molecular Oncology, EarlyView.The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla +10 more
wiley +1 more source
Graph isomorphism completeness for trapezoid graphs
, 2015 The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of ...
Takaoka, Asahi
core +1 more source
Precoloring extension. I. Interval graphs [PDF]
Discrete Mathematics, 1992 The precoloring extension problem is defined as follows: given an integer \(k\geq 2\), a graph \(G=(V,E)\) with \(| V|\geq k\), a vertex-subest \(W\subseteq V\), and a proper \(k\)-coloring of the subgraph of \(G\) induced by \(W\), can this \(k\)-coloring be extended to a proper \(k\)-coloring of the whole graph \(G\)?
Biró, M., Hujter, M., Tuza, Zs.
openaire +2 more sources
Molecular Oncology, EarlyView.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Distance Two Surjective Labelling of Paths and Interval Graphs
Discrete Dynamics in Nature and Society, 2021 Graph labelling problem has been broadly studied for a long period for its applications, especially in frequency assignment in (mobile) communication system, X-ray crystallography, circuit design, etc.
Sk Amanathulla +3 more
doaj +1 more source
Correlation of the differential expression of PIK3R1 and its spliced variant, p55α, in pan‐cancer
Molecular Oncology, EarlyView.PIK3R1 undergoes alternative splicing to generate the isoforms, p85α and p55α. By combining large patient datasets with laboratory experiments, we show that PIK3R1 spliced variants shape cancer behavior. While tumors lose the protective p85α isoform, p55α is overexpressed, changes linked to poorer survival and more pronounced in African American ...
Ishita Gupta +10 more
wiley +1 more source
Interval Incidence Coloring of Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is NP-complete, and ...
Małafiejska Anna, Małafiejski Michał
doaj +1 more source
On some Graphs with a Unique Perfect Matching
, 2017 We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or claw-free ...
Chaplick, S. +3 more
core +1 more source