Pages that link to "Item:Q1091403"
From MaRDI portal
The following pages link to Graphoidal covers and graphoidal covering number of a graph (Q1091403):
Displaying 20 items.
- On graphs whose graphoidal domination number is one (Q321997) (← links)
- Bounds on graphoidal length of a graph (Q327633) (← links)
- Domination in graphoidally covered graphs: least-kernel graphoidal covers (Q327691) (← links)
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- Graphoidal bipartite graphs (Q1343223) (← links)
- Acyclic graphoidal covers and path partitions in a graph (Q1584403) (← links)
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II (Q1643914) (← links)
- Induced graphoidal decompositions in product graphs (Q2249943) (← links)
- Induced label graphoidal graphs (Q2254542) (← links)
- New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph (Q3296849) (← links)
- Graphoidal graphs and graphoidal digraphs: a generalization of line graphs (Q5012356) (← links)
- On graphoidal length of a tree in terms of its diameter (Q5012367) (← links)
- Graphoidally independent infinite graphs (Q5016218) (← links)
- SIMPLE GRAPHOIDAL COVER ON TENSOR PRODUCT OF GRAPHS (Q5036151) (← links)
- Truly non-trivial graphoidal graphs (Q5097778) (← links)
- The distinguishing number and the distinguishing index of line and graphoidal graph(s) (Q5154552) (← links)
- (Q5205872) (← links)
- (Q5224189) (← links)
- Monophonic graphoidal covering number of corona product graphs (Q6113660) (← links)
- Difference Labeling and Decomposition (Q6187745) (← links)