Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
From MaRDI portal
Publication:5012356
DOI10.1080/09728600.2020.1832854zbMath1471.05038OpenAlexW3097363179MaRDI QIDQ5012356
Publication date: 1 September 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09728600.2020.1832854
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphoidal covers and graphoidal covering number of a graph
- On the graphoidal covering number of a graph
- The graphoidal covering number of unicyclic graphs
- Graphoidal bipartite graphs
- Acyclic graphoidal covers and path partitions in a graph
- On graphoidal graphs of a tree
- Path graphs
- On graphoidal graphs
- A note on the graphoidal covering number of a graph
- Characterizations of derived graphs
- Graphs whose acyclic graphoidal covering number is one less than its maximum degree
This page was built for publication: Graphoidal graphs and graphoidal digraphs: a generalization of line graphs