Live briefing
Everything about Peripheral cycle
Graph cycle which does not separate remaining elements
In graph theory, a peripheral cycle in an undirected graph is, intuitively, a cycle that does not separate any part of the graph from any other part. Peripheral cycles were first studied by Tutte (1963), and play important roles in the characterization of planar graphs and in generating the cycle spaces of nonplanar graphs. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Peripheral cycleA 5-minute orientation
- Skim a recent paper: Assessment of cell cycle regulators in human peripheral blood cells as markers of cellular senescenceInfluential work since 2022
- Pick up a classic book: BiologyThe most-reprinted book on the subject
- Read the landmark paper: Ovarian and Adrenal Contribution to Peripheral Androgens During the Menstrual CycleCited 340 times
- Go sideways: Dual graphA closely related topic
- Go sideways: Glossary of graph theoryA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Ovarian and Adrenal Contribution to Peripheral Androgens During the Menstrual Cycle
Peripheral control of the cat's step cycle
Immune awakening revealed by peripheral T cell dynamics after one cycle of immunotherapy
Sonic Hedgehog Promotes Cell Cycle Progression in Activated Peripheral CD4+ T Lymphocytes
PROGESTERONE CONCENTRATION IN THE PERIPHERAL PLASMA OF SHEEP DURING THE OESTROUS CYCLE
Circadian clocks: Neural and peripheral pacemakers that impact upon the cell division cycle
PERIPHERAL PLASMA PROGESTERONE LEVELS DURING THE BOVINE OESTROUS CYCLE
Behavior of peripheral rods and their role in the life cycle of Myxococcus xanthus
🆕 Influential since 2022
Assessment of cell cycle regulators in human peripheral blood cells as markers of cellular senescence
Brain insulin action on peripheral insulin sensitivity in women depends on menstrual cycle phase
Effect of rapid cycle deliberate practice in peripheral intravenous catheters insertion training: A simulation experimental study
Cycle dynamics and synchronization in a coupled network of peripheral circadian clocks
Facilitation of Cell Cycle and Cellular Migration of Rat Schwann Cells by O‐Carboxymethyl Chitosan to Support Peripheral Nerve Regeneration
📚 Books worth reading
BiologyKenneth R. Miller, Joseph S. Levine · 1990
Annual review of physiologyJames Murray Luck, Victor E. Hall · 1939
Nutrition in clinical practiceDavid L. Katz · 2000
Anatomy and PhysiologyJ. Gordon Betts, Peter DeSaix · 2013
Digital planetGeorge Beekman, Ben Beekman · 2011
PTAexamScott M. Giles · 2010
Fanconi anemiaD. Schindler, H. Hoehn · 2007
Fat detectionJean-Pierre Montmayeur · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Dual graph In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Graphic matroid In the mathematical theory of matroids, a graphic matroid (also called a cycle matroid or polygon matroid) is a matroid whose independent sets are the…
- Planar graph In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect…
- Subhamiltonian graph In graph theory and graph drawing, a subhamiltonian graph is a subgraph of a planar Hamiltonian graph. A graph G is subhamiltonian if G is a subgraph of…
- Component (graph theory) In graph theory, a component of an undirected graph is a connected subgraph that is not part of any larger connected subgraph. The components of any graph…
- Ear decomposition In graph theory, an ear of an undirected graph G is a path P where the two endpoints of the path may coincide, but where otherwise no repetition of edges…
- Matroid parity problem In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid, a structure…