Pages that link to "Item:Q5625203"
From MaRDI portal
The following pages link to Properties and characterizations of <i>k</i> ‐trees (Q5625203):
Displaying 35 items.
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees (Q433082) (← links)
- Matching preclusion and conditional matching preclusion for regular interconnection networks (Q442207) (← links)
- Generating and counting unlabeled \(k\)-path graphs (Q496683) (← links)
- Rigidity and the lower bound theorem. I (Q578590) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- Separating subgraphs in k-trees: Cables and caterpillars (Q795842) (← links)
- On the structure and deficiency of \(k\)-trees with bounded degree (Q908291) (← links)
- Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
- A clique-difference encoding scheme for labelled \(k\)-path graphs (Q1003468) (← links)
- Hamiltonian connectivity of 2-tree-generated networks (Q1007659) (← links)
- Existence of graphs with a given set of r-neighborhoods (Q1053037) (← links)
- Interior graphs of maximal outerplane graphs (Q1059083) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
- Characterization of partial 3-trees in terms of three structures (Q1086577) (← links)
- Degree sets of k-trees: Small k (Q1164068) (← links)
- Intersection properties of boxes. II: Extremal families (Q1182651) (← links)
- A characterization of \(k\)-trees (Q1198515) (← links)
- On some strongly rigid families of graphs and the full embeddings they induce (Q1214943) (← links)
- The square of a chordal graph (Q1322181) (← links)
- Multidimensional bipartite trees (Q1415538) (← links)
- A kind of conditional connectivity of transposition networks generated by \(k\)-trees (Q1701105) (← links)
- \(k\)-Wiener index of a \(k\)-plex (Q2075457) (← links)
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks (Q2077379) (← links)
- Cyclotomic and simplicial matroids (Q2382259) (← links)
- Structure of wheel-trees with colourings and domination numbers (Q2413362) (← links)
- A characterization of 2-tree probe interval graphs (Q2509539) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- Characterizations of H-graphs (Q2795961) (← links)
- Linearly many faults in 2-tree-generated networks (Q3057135) (← links)
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS (Q3606558) (← links)
- Simplicial matrix-tree theorems (Q3642704) (← links)
- Characterization and Recognition of Partial 3-Trees (Q3728922) (← links)
- (Q5094088) (← links)
- Generalized loop‐erased random walks and approximate reachability (Q5409862) (← links)
- (Q6072029) (← links)