Structural properties of subdivided-line graphs (Q2018541): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2015.01.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2044393195
@@ Property / OpenAlex ID: W2044393195 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5396737
@@ Property / cites work: Q5396737 / rank @@
+Normal rank
@@ Property / cites work @@
+The book thickness of a graph
@@ Property / cites work: The book thickness of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3065457
@@ Property / cites work: Q3065457 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Edge-disjoint Hamilton cycles in graphs
@@ Property / cites work: Edge-disjoint Hamilton cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
+Normal rank
@@ Property / cites work @@
+Finding Four Independent Trees
@@ Property / cites work: Finding Four Independent Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint Hamilton cycles in the star graph
@@ Property / cites work: Disjoint Hamilton cycles in the star graph / rank @@
+Normal rank
@@ Property / cites work @@
+Line Digraph Iterations and the (d, k) Digraph Problem
+Normal rank
@@ Property / cites work @@
+Hamiltonian connectivity of the WK-recursive network with faulty nodes
+Normal rank
@@ Property / cites work @@
+Optimal book embeddings of the FFT, Benes, and barrel shifter networks
+Normal rank
@@ Property / cites work @@
+The pagenumber of \(k\)-trees is \(O(k)\)
@@ Property / cites work: The pagenumber of \(k\)-trees is \(O(k)\) / rank @@
+Normal rank
@@ Property / cites work @@
+The hub number of a graph
@@ Property / cites work: The hub number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+New results on variants of covering codes in Sierpiński graphs
+Normal rank
@@ Property / cites work @@
+Completely independent spanning trees in the underlying graph of a line digraph
+Normal rank
@@ Property / cites work @@
+Q4414501
@@ Property / cites work: Q4414501 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding iterated line digraphs in books
@@ Property / cites work: Embedding iterated line digraphs in books / rank @@
+Normal rank
@@ Property / cites work @@
+Improved book-embeddings of incomplete hypercubes
@@ Property / cites work: Improved book-embeddings of incomplete hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Completely independent spanning trees in torus networks
+Normal rank
@@ Property / cites work @@
+Independent spanning trees with small depths in iterated line digraphs
+Normal rank
@@ Property / cites work @@
+Embedding de Bruijn, Kautz and shuffle-exchange networks in books
+Normal rank
@@ Property / cites work @@
+Coloring Hanoi and Sierpiński graphs
@@ Property / cites work: Coloring Hanoi and Sierpiński graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The average eccentricity of Sierpiński graphs
@@ Property / cites work: The average eccentricity of Sierpiński graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sierpiński graphs as spanning subgraphs of Hanoi graphs
+Normal rank
@@ Property / cites work @@
+Independent trees in planar graphs
@@ Property / cites work: Independent trees in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The multi-tree approach to reliability in distributed networks
+Normal rank
@@ Property / cites work @@
+Independent spanning trees of chordal rings
@@ Property / cites work: Independent spanning trees of chordal rings / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-, edge-, and total-colorings of Sierpiński-like graphs
+Normal rank
@@ Property / cites work @@
+The connected hub number and the connected domination number
+Normal rank
@@ Property / cites work @@
+Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
+Normal rank
@@ Property / cites work @@
+Crossing numbers of Sierpiński‐like graphs
@@ Property / cites work: Crossing numbers of Sierpiński‐like graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+The hub number of Sierpiński-like graphs
@@ Property / cites work: The hub number of Sierpiński-like graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Global strong defensive alliances of Sierpiński-like graphs
+Normal rank
@@ Property / cites work @@
+Genus g Graphs Have Pagenumber O(√g)
@@ Property / cites work: Genus g Graphs Have Pagenumber O(√g) / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint Hamiltonian cycles in recursive circulant graphs
+Normal rank
@@ Property / cites work @@
+Pagenumber of complete bipartite graphs
@@ Property / cites work: Pagenumber of complete bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Two counterexamples on completely independent spanning trees
+Normal rank
@@ Property / cites work @@
+The pagenumber of the class of bandwidth-k graphs is \(k-1\)
+Normal rank
@@ Property / cites work @@
+Independent Spanning Trees on Multidimensional Torus Networks
+Normal rank
@@ Property / cites work @@
+Q5471356
@@ Property / cites work: Q5471356 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3043733
@@ Property / cites work: Q3043733 / rank @@
+Normal rank
@@ Property / cites work @@
+The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
+Normal rank
@@ Property / cites work @@
+The linear \(t\)-colorings of Sierpiński-like graphs
+Normal rank
@@ Property / cites work @@
+Shortest paths in Sierpiński graphs
@@ Property / cites work: Shortest paths in Sierpiński graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank
@@ Property / cites work @@
+Three tree-paths
@@ Property / cites work: Three tree-paths / rank @@
+Normal rank