Nonuniform subset graphs associated with any graph
From MaRDI portal
Cites work
- Computing the edge irregularity strengths of chain graphs and the join of two graphs
- Diameters of uniform subset graphs
- Extremal combinatorics. With applications in computer science
- Hamiltonian uniform subset graphs
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 146670 (Why is no real title available?)
- Johnson graphs are Hamilton-connected
- Kneser's conjecture, chromatic number, and homotopy
- On the 2-token graph of a graph
- On the 2-Token Graphs of Some Disjoint Union of Graphs
- On the girth and diameter of generalized Johnson graphs
- The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
- Token graphs
This page was built for publication: Nonuniform subset graphs associated with any graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228547)