Almost every graph has a fixed edge
From MaRDI portal
Recommendations
Cites work
- Almost every graph has reconstruction number three
- Bidegreed graphs are edge reconstructible
- Graph theory with applications
- scientific article; zbMATH DE number 640515 (Why is no real title available?)
- scientific article; zbMATH DE number 3227794 (Why is no real title available?)
- scientific article; zbMATH DE number 3387379 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- On the fixed edge of planar graphs with minimum degree five
Cited in
(5)- scientific article; zbMATH DE number 4043868 (Why is no real title available?)
- scientific article; zbMATH DE number 500364 (Why is no real title available?)
- scientific article; zbMATH DE number 1145919 (Why is no real title available?)
- scientific article; zbMATH DE number 1150354 (Why is no real title available?)
- Graphs isomorphisms under edge-replacements and the family of amoebas
This page was built for publication: Almost every graph has a fixed edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955847)