THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS

DOI10.14529/mmph210409zbMath1486.05100OpenAlexW4288521881MaRDI QIDQ5067355

M. B. Abrosimov, Petr Vladimirovich Razumovskiĭ

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

zbMATH Keywords

complete graphscolored graphscolored graph extensionsgraph minimal extensionsgraph vertex extensions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• A Graph Model for Fault-Tolerant Computing Systems
• Generation of colored graphs with isomorphism rejection
• The search for minimal edge 1-extension of an undirected colored graph
• Edge fault tolerance in graphs

This page was built for publication: THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS