The search for minimal edge 1-extension of an undirected colored graph

DOI10.18500/1816-9791-2021-21-3-400-407zbMath1482.05324OpenAlexW3196840777MaRDI QIDQ5154917

Petr Vladimirovich Razumovskiĭ

Publication date: 5 October 2021

Published in: Izvestia of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/isu905

zbMATH Keywords

fault tolerancegraph isomorphismcolored graphsgraph coloringsminimal extensionsgraph extensionscolored graph isomorphismedge extensions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS

This page was built for publication: The search for minimal edge 1-extension of an undirected colored graph