Nonsplit Graphs with Split Maximal Induced Subgraphs
From MaRDI portal
Publication:6154170
Recommendations
Cites work
- A survey of some open questions in reconstruction numbers.
- Almost every graph has reconstruction number three
- Degree associated edge reconstruction number of split graphs with biregular independent set is one
- scientific article; zbMATH DE number 17789 (Why is no real title available?)
- scientific article; zbMATH DE number 1557063 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 822735 (Why is no real title available?)
- scientific article; zbMATH DE number 867654 (Why is no real title available?)
- scientific article; zbMATH DE number 2200042 (Why is no real title available?)
- scientific article; zbMATH DE number 3258862 (Why is no real title available?)
- Reconstruction of distance hereditary 2-connected graphs
- Split graphs
- Split Graphs Having Dilworth Number Two
- The graph reconstruction number
- The reconstruction conjecture is true if all 2-connected graphs are reconstructible
- The splittance of a graph
- The vertex and edge graph reconstruction numbers of small graphs
This page was built for publication: Nonsplit Graphs with Split Maximal Induced Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154170)