The following pages link to (Q3808121):
Displaying 26 items.
- Vertex-disjoint subgraphs with high degree sums (Q322265) (← links)
- Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711) (← links)
- Splits of circuits (Q710606) (← links)
- Cycles with consecutive odd lengths (Q896065) (← links)
- Non-separating subgraphs in highly connected graphs (Q905893) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Blocking set free configurations and their relations to digraphs and hypergraphs (Q1356757) (← links)
- Cycle lengths and minimum degree of graphs (Q1682209) (← links)
- Decomposing edge-colored graphs under color degree constraints (Q1689962) (← links)
- On the existence of vertex-disjoint subgraphs with high degree sum (Q1693134) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Generalized arboricity of graphs with large girth (Q1732768) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- Reducible configurations for the cycle double cover conjecture (Q1962036) (← links)
- Decomposition of graphs with constraint on minimum degree (Q2172390) (← links)
- On lower bounds for the chromatic number in terms of vertex degree (Q2275368) (← links)
- On two conjectures about the proper connection number of graphs (Q2359964) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- On a conjecture of Thomassen (Q2517648) (← links)
- On connected partition with degree constraints (Q2666577) (← links)
- Partition of a travel into circuits (Q2774164) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- The Even Cycle Problem for Directed Graphs (Q3993798) (← links)
- (Q4263477) (← links)
- Linear cycles of consecutive lengths (Q6051045) (← links)
- Partitioning graphs with linear minimum degree (Q6623579) (← links)
