Maximum chordal subgraphs of random graphs
From MaRDI portal
Cites work
- A characterisation of rigid circuit graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- Chordal graphs
- Combinatorial theorems in sparse random sets
- Extremal cuts of sparse random graphs
- Extremal results for random discrete structures
- Extremal subgraphs of random graphs
- Finding hidden cliques in linear time with high probability
- Hiding cliques for cryptographic security
- scientific article; zbMATH DE number 4055650 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 219244 (Why is no real title available?)
- scientific article; zbMATH DE number 1380608 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- Largest subgraph from a hereditary property in a random graph
- Mantel's theorem for random graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- MAX k‐CUT and approximating the chromatic number of random graphs
- Maximal chordal subgraphs
- On rigid circuit graphs
- On the max-cut of sparse random graphs
- Random graphs.
- Spanning maximal planar subgraphs of random graphs
- Spanning subgraphs of random graphs
- Turán‐type problems for long cycles in random and pseudo‐random graphs
This page was built for publication: Maximum chordal subgraphs of random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883602)
