The minimal vertex extensions for colored complete graphs
From MaRDI portal
Publication:5067355
Recommendations
- Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives
- The search for minimal edge 1-extension of an undirected colored graph
- Construction of all minimal edge extensions of the graph with isomorphism rejection
- Characterization of graphs with a small number of additional arcs in a minimal 1-vertex extension
- Vertex extensions of 4-layer graphs and hypercubes
Cites work
- scientific article; zbMATH DE number 913340 (Why is no real title available?)
- scientific article; zbMATH DE number 914394 (Why is no real title available?)
- A Graph Model for Fault-Tolerant Computing Systems
- Edge fault tolerance in graphs
- Generation of colored graphs with isomorphism rejection
- The search for minimal edge 1-extension of an undirected colored graph
Cited in
(7)- scientific article; zbMATH DE number 7301718 (Why is no real title available?)
- Edge-colored graphs with applications to homogeneous faults
- scientific article; zbMATH DE number 3205929 (Why is no real title available?)
- The search for minimal edge 1-extension of an undirected colored graph
- Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives
- Construction of all minimal edge extensions of the graph with isomorphism rejection
- Vertex extensions of 4-layer graphs and hypercubes
This page was built for publication: The minimal vertex extensions for colored complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5067355)
