The following pages link to Regularisable graphs I (Q1251673):
Displayed 11 items.
- Inducing regulation of any digraphs (Q1028421) (← links)
- Minimal 2-matching-covered graphs (Q1043944) (← links)
- Ear-decompositions of matching-covered graphs (Q1052341) (← links)
- Magic graphs, a characterization (Q1110540) (← links)
- Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling (Q1297493) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- 1-well-covered graphs revisited (Q2311371) (← links)
- Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652) (← links)
- Node-Balancing by Edge-Increments (Q3452807) (← links)
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph (Q3960467) (← links)
- A partial refining of the Erdős-Kelly regulation (Q5106664) (← links)