Pages that link to "Item:Q3924251"
From MaRDI portal
The following pages link to Recursive Graphs, Recursive Labelings and Shortest Paths (Q3924251):
Displaying 12 items.
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- Separating subgraphs in k-trees: Cables and caterpillars (Q795842) (← links)
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) (← links)
- Knowledge representation for mathematical discovery: Three experiments in graph theory (Q1183372) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)
- Subclasses of \(k\)-trees: characterization and recognition (Q2489905) (← links)
- (Q2741352) (← links)
- A Cryptographic Code Based on Digraphs (Q3438995) (← links)
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
- Leader-follower coherence in noisy ring-trees networks (Q6132343) (← links)
