scientific article; zbMATH DE number 1454641

MaRDI QIDQ4484774zbMATH OpenFDO

Authors Iwao Sato

Publication date 8 November 2000

zbMATH Keywords

enumerationgraph coveringisomorphismsymmetric digraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)

Recommendations

• Coverings of digraphs
• scientific article; zbMATH DE number 861307
• scientific article; zbMATH DE number 2188364
• scientific article; zbMATH DE number 5657426
• Enumerating regular graph coverings whose covering transformation groups are \(\mathbb{Z}_2\)-extensions of a cyclic group

Cited in

(20)

• Covering graphs: The covering problem solved
• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
• Dumbbell graphs with extremal (reverse) cover cost
• An overview of graph covering and partitioning
• Characteristic polynomials and zeta functions of equitably partitioned graphs
• A greedy algorithm to construct covering arrays using a graph representation
• Some computational aspects of solvable regular covers of graphs
• Covering arrays on graphs
• The covering chain of a graph
• On the graph condition regarding the F-inverse cover problem
• scientific article; zbMATH DE number 6500342 (Why is no real title available?)
• Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
• scientific article; zbMATH DE number 5556019 (Why is no real title available?)
• scientific article; zbMATH DE number 4075125 (Why is no real title available?)
• scientific article; zbMATH DE number 89406 (Why is no real title available?)
• scientific article; zbMATH DE number 1236360 (Why is no real title available?)
• scientific article; zbMATH DE number 1454644 (Why is no real title available?)
• scientific article; zbMATH DE number 1890838 (Why is no real title available?)
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• On cover-structure graphs

This page was built for publication:

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