The following pages link to (Q4894618):
Displaying 10 items.
- Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711) (← links)
- Colorings and girth of oriented planar graphs (Q1356774) (← links)
- Homomorphisms from sparse graphs with large girth. (Q1425115) (← links)
- On universal graphs for planar oriented graphs of a given girth (Q1584330) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- On the density of \(C_7\)-critical graphs (Q2151187) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (Q3644743) (← links)
- (Q4944681) (← links)
- Fractional coloring planar graphs under Steinberg-type conditions (Q6113758) (← links)
