The structure of transform graphs
From MaRDI portal
Publication:1377873
DOI10.1016/S0012-365X(96)00360-3zbMATH Open0908.05061OpenAlexW2078468229MaRDI QIDQ1377873FDOQ1377873
Authors: Bill Jackson, J. Sheehan
Publication date: 8 March 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00360-3
Recommendations
Cites Work
- On size Ramsey number of paths, trees, and circuits. I
- Hamiltonian circuits in random graphs
- Advances in graph theory
- On Hamiltonian Circuits
- Title not available (Why is that?)
- Graphs uniquely Hamiltonian-connected from a vertex
- The size of graphs uniquely Hamiltonian-connected from a vertex
- The minimum size of graphs Hamiltonian-connected from a vertex
- On the structure of graphs uniquely hamiltonian-connected from a vertex
Cited In (12)
- Diagrammatic Representation and Inference
- Hodograph-type transformations
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Results and problems concerning edge transformed graphs
- Graphical Model of the Biquadratic Transformation
- Title not available (Why is that?)
- Basic properties of total transformation graphs
- Title not available (Why is that?)
- Transformations on channel graphs
This page was built for publication: The structure of transform graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377873)