scientific article; zbMATH DE number 2230241
From MaRDI portal
Publication:5708533
zbMath1075.05581MaRDI QIDQ5708533
Aneta Dudek, Gyula Y. Katona, Adam Paweł Wojda
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs ⋮ On the number of edges in a minimum \(C_6\)-saturated graph
Cites Work
- A method in graph theory
- On maximal paths and circuits of graphs
- Saturated graphs with minimal number of edges
- Hamiltonian circuits and path coverings of vertices in graphs
- Hamiltonian shortage, path partitions of vertices, and matchings in a graph
- Graphs maximal with respect to absence of hamiltonian paths
This page was built for publication:
