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

DOI10.18500/1816-9791-2021-21-3-400-407MaRDI QIDQ5154917zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

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

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

Recommendations

• The minimal vertex extensions for colored complete graphs
• Generation of colored graphs with isomorphism rejection
• Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension
• Characterization of graphs with a small number of additional arcs in a minimal 1-vertex extension
• Restricted extension of sparse partial edge colorings of complete graphs

Cited in

(4)

• Edge-colored graphs with applications to homogeneous faults
• Generation of colored graphs with isomorphism rejection
• The minimal vertex extensions for colored complete graphs
• Construction of all minimal edge extensions of the graph with isomorphism rejection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154917)