The minimal vertex extensions for colored complete graphs
From MaRDI portal
Publication:5067355
DOI10.14529/MMPH210409zbMATH Open1486.05100OpenAlexW4288521881MaRDI QIDQ5067355FDOQ5067355
Authors: Petr Vladimirovich Razumovskiĭ, M. B. Abrosimov 
Publication date: 1 April 2022
Published in: Bulletin of the South Ural State University series "Mathematics. Mechanics. Physics" (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vyurm503
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
complete graphscolored graphscolored graph extensionsgraph minimal extensionsgraph vertex extensions
Cites Work
Cited In (7)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge-colored graphs with applications to homogeneous faults
- The search for minimal edge 1-extension of an undirected colored graph
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)
