Pages that link to "Item:Q5902536"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902536):
Displaying 14 items.
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract) (Q2768335) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
- A novel discussion on power fuzzy graphs and their application in decision making (Q6567337) (← links)
- On regular power fuzzy graphs (Q6671114) (← links)
