Results 101 to 110 of about 96,099 (217)
Orbit, 2018 Thomas Pynchon’s novel Gravity’s Rainbow (1973) sports three equations in mathematical notation, and the second of these has puzzled readers for 45 years: is Pynchon’s Second Equation real or made up?
Harald Engelhardt, Nina Engelhardt
doaj +2 more sources
Restoration Ecology, EarlyView.Dam removals are increasing globally, yet ecological outcomes vary widely because biological recovery depends on post‐removal connectivity and access to source populations. We evaluated how multiple dam removals and remaining fragmentation influenced fish assemblage recovery in the Cuyahoga River (OH, United States), a historically polluted Great Lakes
Matthew R. Acre +14 more
wiley +1 more source
On the rainbow connection numbers of line, middle, and total graphs of wheels
Electronic Journal of Graph Theory and ApplicationsAn edge-colored graph G is called rainbow connected if any two vertices in G are connected by a path whose no two edges are colored the same. The rainbow connection of G, denoted by rc(G), is the smallest number of colors needed such that G be a rainbow ...
Lyra Yulianti +2 more
doaj +1 more source
WORM Colorings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the
Czap J., Jendrol’ S., Valiska J.
doaj +1 more source
The Parameterized Complexity of the Rainbow Subgraph Problem
Algorithms, 2015 The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices.
Falk Hüffner +3 more
doaj +1 more source
An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth
Journal of Graph Theory, Volume 112, Issue 4, Page 409-420, August 2026.ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth k admit a partition with ‘local,
Marc Distel
wiley +1 more source
Rainbow connection number of corona product of graphs
Electronic Journal of Graph Theory and ApplicationsIn an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection
Fendy Septyanto
doaj +1 more source
Reading Research Quarterly, Volume 61, Issue 3, July/August/September 2026.In the abstract, we have graphically presented the aim and design of the randomized control trial. Furthermore, our key findings on both the interventions' effectiveness and learning transfer across media are briefly explained. ABSTRACT This randomized control trial examined the contribution of teacher‐led phonics instruction and GraphoLearn‐Rime (GL ...
Deepti Bora +3 more
wiley +1 more source
Science Education, Volume 110, Issue 4, Page 1001-1017, July 2026.ABSTRACT Trans, nonbinary, and intersex persons are—and have always been—an integral part of humankind. However, these communities are under attack. We live in a time of growing state repression and the normalization of political violence against trans, nonbinary, and intersex persons throughout much of the world, and we have a responsibility to ...
Quentin C. Sedlacek +30 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2018 A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source