Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
From MaRDI portal
Publication:6132556
Recommendations
- scientific article; zbMATH DE number 1833409
- scientific article; zbMATH DE number 930115
- scientific article; zbMATH DE number 1190654
- Maximum regular induced subgraphs in 2P₃-free graphs
- Maximum \(k\)-regular induced subgraphs
- On maximal 3-restricted edge connectivity of regular graphs
- The maximum degree \& diameter-bounded subgraph and its applications
- Approximating the maximum 3-edge-colorable subgraph problem
- The Maximum k-Colorable Subgraph Problem and Related Problems
- The maximum k-colorable subgraph problem for chordal graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- A linear time algorithm for embedding Christmas trees into certain trees
- A note on minimum linear arrangement for BC graphs
- An edge-isoperimetric problem for powers of the Petersen graph
- Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
- New gossips and telephones
- Optimal Assignments of Numbers to Vertices
- Wirelength of hypercubes into certain trees
Cited in
(3)
This page was built for publication: Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132556)
