Transversal panconnectedness in graph collections
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites work
- A better bound on the size of rainbow matchings
- A general approach to transversal versions of Dirac‐type theorems
- A General Criterion for the Existence of Transversals
- A rainbow version of Mantel's theorem
- Dirac type condition and Hamiltonian-connected graphs
- Extending cycles in graphs
- Graph theory
- Hamilton connected graphs
- Hamilton transversals in tournaments
- Hamiltonian paths and hamiltonian connectivity in graphs
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- On a rainbow version of Dirac's theorem
- On Hamiltonian bipartite graphs
- On Hamiltonian-connected regular graphs
- On sets of almost disjoint subsets of a set
- On the rainbow matching conjecture for 3-uniform hypergraphs
- Panconnected graphs. II
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Rainbow Pancyclicity in a Collection of Graphs Under the Dirac-type Condition
- Rainbow pancyclicity in graph systems
- Rainbow spanning structures in graph and hypergraph systems
- Rainbow structures in a collection of graphs with degree conditions
- Some Theorems on Abstract Graphs
- Spanning trees in dense graphs
- The minimum degree threshold for perfect graph packings
- Transversal factors and spanning trees
- Transversals and bipancyclicity in bipartite graph families
This page was built for publication: Transversal panconnectedness in graph collections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6901245)
