Structural properties of subdivided-line graphs
type: Item
instance of: scholarly article
title: Structural properties of subdivided-line graphs
zbMATH Open document ID: 1325.05139
author: Toru Hasunuma
published in: Journal of Discrete Algorithms
publication date: 2015-03-24T00:00:00Z
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 6419170
zbMATH Keywords: subdivided line graph
zbMATH Keywords: Sierpiński graph
zbMATH Keywords: edge-disjoint Hamilton cycles
zbMATH Keywords: Hamiltonian-connectivity
zbMATH Keywords: hub set
zbMATH Keywords: connected dominating set
zbMATH Keywords: independent spanning trees
zbMATH Keywords: completely independent spanning trees
zbMATH Keywords: book embedding
MaRDI profile type: Publication
full work available at URL: j.jda.2015.01.008
OpenAlex ID: W2044393195
cites work: Q5396737
cites work: The book thickness of a graph
cites work: Q3065457
cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
cites work: Edge-disjoint Hamilton cycles in graphs
cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
cites work: Finding Four Independent Trees
cites work: Disjoint Hamilton cycles in the star graph
cites work: Line Digraph Iterations and the (d, k) Digraph Problem
cites work: Hamiltonian connectivity of the WK-recursive network with faulty nodes
cites work: Optimal book embeddings of the FFT, Benes, and barrel shifter networks
cites work: The pagenumber of \(k\)-trees is \(O(k)\)
cites work: The hub number of a graph
cites work: New results on variants of covering codes in Sierpiński graphs
cites work: Completely independent spanning trees in the underlying graph of a line digraph
cites work: Q4414501
cites work: Embedding iterated line digraphs in books
cites work: Improved book-embeddings of incomplete hypercubes
cites work: Completely independent spanning trees in torus networks
cites work: Independent spanning trees with small depths in iterated line digraphs
cites work: Embedding de Bruijn, Kautz and shuffle-exchange networks in books
cites work: Coloring Hanoi and Sierpiński graphs
cites work: The average eccentricity of Sierpiński graphs
cites work: Sierpiński graphs as spanning subgraphs of Hanoi graphs
cites work: Independent trees in planar graphs
cites work: The multi-tree approach to reliability in distributed networks
cites work: Independent spanning trees of chordal rings
cites work: Vertex-, edge-, and total-colorings of Sierpiński-like graphs
cites work: The connected hub number and the connected domination number
cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
cites work: Crossing numbers of Sierpiński‐like graphs
cites work: On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
cites work: Q4002466
cites work: The hub number of Sierpiński-like graphs
cites work: Global strong defensive alliances of Sierpiński-like graphs
cites work: Genus g Graphs Have Pagenumber O(√g)
cites work: Disjoint Hamiltonian cycles in recursive circulant graphs
cites work: Pagenumber of complete bipartite graphs
cites work: Two counterexamples on completely independent spanning trees
cites work: The pagenumber of the class of bandwidth-k graphs is \(k-1\)
cites work: Independent Spanning Trees on Multidimensional Torus Networks
cites work: Q5471356
cites work: Q3043733
cites work: The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
cites work: The linear \(t\)-colorings of Sierpiński-like graphs
cites work: Shortest paths in Sierpiński graphs
cites work: On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
cites work: Embedding planar graphs in four pages
cites work: Three tree-paths
DOI: 10.1016/J.JDA.2015.01.008
description: scientific article; zbMATH DE number 6419170