Pages that link to "Item:Q3972522"
From MaRDI portal
The following pages link to The expansion procedure for graphs (Q3972522):
Displaying 37 items.
- Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. II: Fixed subgraph properties and infinite treelike partial cubes (Q658019) (← links)
- Expansion in matrix-weighted graphs (Q821011) (← links)
- Maximal proper subgraphs of median graphs (Q878630) (← links)
- On the geodetic number of median graphs (Q941326) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- Cage-amalgamation graphs, a common generalization of chordal and median graphs (Q1024305) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← links)
- Netlike partial cubes, V: completion and netlike classes (Q1043960) (← links)
- Expanding graphs and invariant means (Q1276303) (← links)
- The direct expansion of graphs (Q1349072) (← links)
- The majority strategy on graphs (Q1377621) (← links)
- The median procedure on median graphs (Q1392574) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- Geodetic spectra of graphs. (Q1427436) (← links)
- An Euler-type formula for median graphs (Q1584314) (← links)
- On subgraphs of Cartesian product graphs and S-primeness (Q1827726) (← links)
- Intersection graphs of maximal hypercubes (Q1867285) (← links)
- The geodetic number of an oriented graph (Q1971800) (← links)
- The median function on median graphs and semilattices (Q1975374) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- Tree-like partial Hamming graphs (Q2442273) (← links)
- The geodetic numbers of graphs and digraphs (Q2461517) (← links)
- On median nature and enumerative properties of Fibonacci-like cubes (Q2568482) (← links)
- Planar median graphs and cubesquare-graphs (Q2691567) (← links)
- Θ-graphs of partial cubes and strong edge colorings (Q3439627) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- On the Edge-Expansion of Graphs (Q4348783) (← links)
- The shrinking-and-expanding method for the graph enumeration (Q4522762) (← links)
- (Q4890703) (← links)
- Five axioms for location functions on median graphs (Q5261047) (← links)
- What Do Trees and Hypercubes Have in Common? (Q5506781) (← links)
- Crossing graphs of fiber-complemented graphs (Q5899397) (← links)
- Crossing graphs of fiber-complemented graphs (Q5920427) (← links)
- Binary Coding of Resonance Graphs of Catacondensed Polyhexes (Q6112663) (← links)
- A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs (Q6565816) (← links)
- Boundary rigidity of CAT(0) cube complexes (Q6615759) (← links)
