Sierpiński graphs as spanning subgraphs of Hanoi graphs

Sierpiński graphs as spanning subgraphs of Hanoi graphs

Bibliographic Details
Main Authors:	Hinz Andreas, Klavžar Sandi, Zemljič Sara
Format:	Article
Language:	English
Published:	De Gruyter 2013-06-01
Series:	Open Mathematics
Subjects:	05c60 sierpiński graph hanoi graph spanning subgraph hamming graph
Online Access:	https://doi.org/10.2478/s11533-013-0227-7

Similar Items

The Hanoi Graph H43
by: Hinz Andreas M., et al.
Published: (2020-11-01)

Power Domination in Knödel Graphs and Hanoi Graphs
by: Varghese Seethu, et al.
Published: (2018-02-01)

Spanning Halin Subgraphs Involving Forbidden Subgraphs
by: Yang, Ping
Published: (2016)

Induced Subgraph Saturated Graphs
by: Craig Tennenhouse
Published: (2016-01-01)

Dense subgraph mining in probabilistic graphs
by: Esfahani, Fatemeh
Published: (2021)

An Efficient Subgraph Isomorphism Solver for Large Graphs
by: Zubair Ali Ansari, et al.
Published: (2021-01-01)

Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
by: Li Binlong, et al.
Published: (2016-11-01)

Tree-Like Partial Hamming Graphs
by: Gologranc Tanja
Published: (2014-02-01)

On Generalized Sierpiński Graphs
by: Rodríguez-Velázquez Juan Alberto, et al.
Published: (2017-08-01)

Large Contractible Subgraphs of a 3-Connected Graph
by: Karpov Dmitri V.
Published: (2021-02-01)

Computing the Metric Dimension of a Graph from Primary Subgraphs
by: Kuziak Dorota, et al.
Published: (2017-02-01)

Subgraph Isomorphism Search In Massive Graph Data
by: Nabti, Chems Eddine
Published: (2017)

Anti-Ramsey Number of Hanoi Graphs
by: Gorgol Izolda, et al.
Published: (2019-02-01)

Distributed Subgraph Matching on Big Knowledge Graphs Using Pregel
by: Qiang Xu, et al.
Published: (2019-01-01)

A New Multi-graph Transformation Method for Frequent Approximate Subgraph Mining
by: Niusvel Acosta Mendoza
Published: (2018-09-01)

Representing Graphs as Bag of Vertices and Partitions for Graph Classification
by: Mansurul Bhuiyan, et al.
Published: (2018-06-01)

Power estimation of the full set of alternatives to Paret's subgraphs in a graph
by: Yu. V. Bugaev, et al.
Published: (2018-10-01)

A Forbidden Subgraph Characterization Problem and a Minimal-Element Subset of Universal Graph Classes
by: Barrus, Michael D.
Published: (2004)

Tr-Span of Directed Wheel Graphs
by: Besson Marc, et al.
Published: (2018-11-01)

Forbidden subgraph pairs for traceability of block-chains
by: Binlong Li, et al.
Published: (2013-04-01)

Completely Independent Spanning Trees in k-Th Power of Graphs
by: Hong Xia
Published: (2018-08-01)

Forbidden subgraphs and 3-colorability
by: Ye, Tianjun
Published: (2013)

Graphs Having Most of Their Eigenvalues Shared by a Vertex Deleted Subgraph
by: Alexander Farrugia
Published: (2021-09-01)

On Minimal Unique Induced Subgraph Queries
by: Lincheng Jiang, et al.
Published: (2018-10-01)

Construction of Barnette graphs whose large subgraphs are non-Hamiltonian
by: Pirzada S., et al.
Published: (2019-12-01)

Large Graph Sampling Algorithm for Frequent Subgraph Mining
by: Tianyu Zheng, et al.
Published: (2021-01-01)

Efficient Subgraph Matching on Large RDF Graphs Using MapReduce
by: Xin Wang, et al.
Published: (2019-04-01)

Building direct and back spanning trees by automata on a graph
by: Igor Burdonov, et al.
Published: (2018-10-01)

In Search of the Densest Subgraph
by: András Faragó, et al.
Published: (2019-08-01)

ON THE GENERALIZED φ -NUMBER AND RELATED PROBLEMS FOR HIGHLY SYMMETRIC GRAPHS
by: Sinjorgo, L., et al.
Published: (2022)

The General Position Problem on Kneser Graphs and on Some Graph Operations
by: Ghorbani Modjtaba, et al.
Published: (2021-11-01)

Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
by: Maumita Chakraborty, et al.
Published: (2018-01-01)

Tree Graphs and Orthogonal Spanning Tree Decompositions
by: Mahoney, James Raymond
Published: (2016)

A ramsey-type theorem for multiple disjoint copies of induced subgraphs
by: Nakamigawa Tomoki
Published: (2014-05-01)

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
by: Takeyuki Tamura, et al.
Published: (2013-02-01)

2-Spanning Cyclability Problems of Some Generalized Petersen Graphs
by: Yang Meng-Chien, et al.
Published: (2020-08-01)

Graph Exponentiation and Neighborhood Reconstruction
by: Hammack Richard H.
Published: (2021-02-01)

The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01)

Optimized Distributed Subgraph Matching Algorithm Based on Partition Replication
by: Ling Yuan, et al.
Published: (2020-01-01)

Generalized Hamming Graphs: Some New Results
by: Bedrane Amari, et al.
Published: (2018-08-01)

Cannot write session to /tmp/vufind_sessions/sess_ldmt3g49h9jmai12ko36slvnu3