scientific article; zbMATH DE number 2170477
From MaRDI portal
Publication:4677974
Recommendations
Cited in
(13)- Bounding cochordal cover number of graphs via vertex stretching
- Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
- On vertex covering number of rotationally-symmetric graphs
- scientific article; zbMATH DE number 5379397 (Why is no real title available?)
- scientific article; zbMATH DE number 5631059 (Why is no real title available?)
- scientific article; zbMATH DE number 109202 (Why is no real title available?)
- scientific article; zbMATH DE number 861353 (Why is no real title available?)
- On the vertex covering sets and vertex cover polynomials of square of ladder graph
- On the number of irreducible covers of a graph by edges
- Coverings, planarity and duals of a semigraph
- The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number
- COVERING GRAPHS WITH OPTIMAL COLLECTION OF EDGES
- Strong and weak edges of a graph and linkages with the vertex cover problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677974)