Rainbow structures in a collection of graphs with degree conditions
From MaRDI portal
Publication:6094031
Recommendations
Cites work
- A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
- A rainbow version of Mantel's theorem
- Extending cycles in graphs
- Graph theory
- scientific article; zbMATH DE number 3186565 (Why is no real title available?)
- Large cycles in graphs
- Large rainbow matchings in general graphs
- New sufficient conditions for cycles in graphs
- Note on Hamilton Circuits
- On a rainbow version of Dirac's theorem
- On Hamilton's ideals
- Rainbow matchings in r-partite r-graphs
- Rainbow pancyclicity in graph systems
- Some Theorems on Abstract Graphs
- Transversal factors and spanning trees
- Transversals and bipancyclicity in bipartite graph families
- Transversals in Latin Squares
- Transversals in row-latin rectangles
Cited in
(14)- Rainbow pancyclicity in graph systems
- Decompositions into spanning rainbow structures
- Rainbow degree-jump coloring of graphs
- Rainbow Pancyclicity in a Collection of Graphs Under the Dirac-type Condition
- Vertex-bipancyclicity in a bipartite graph collection
- Signless Laplacian spectral conditions for the existence of rainbow k-factors in a collection of graphs
- Spectral radius and rainbow k-factors of graphs
- Rainbow Hamiltonicity with large edge numbers
- Stability of transversal Hamilton cycles and paths
- Transversal panconnectedness in graph collections
- Rainbow Hamiltonicity and the spectral radius
- Rainbow directed version of Dirac's theorem
- Dirac-type condition for rainbow chorded pancyclicity
- Transversal Hamilton paths and cycles
This page was built for publication: Rainbow structures in a collection of graphs with degree conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094031)