Pages that link to "Item:Q293190"
From MaRDI portal
The following pages link to The recognition of geodetically connected graphs (Q293190):
Displaying 8 items.
- Some special minimum \(k\)-geodetically connected graphs (Q548276) (← links)
- An efficient algorithm for finding all hinge vertices on trapezoid graphs (Q1405798) (← links)
- Recognizing hinge-free line graphs and total graphs (Q1596464) (← links)
- Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph'' (Q1944158) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- Minimum<i>k</i>-geodetically connected digraphs (Q3157033) (← links)
- Towards minimum<i>k</i>-geodetically connected graphs (Q4804165) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)