Truly non-trivial graphoidal graphs

DOI10.1080/09728600.2022.2077674zbMath1493.05252OpenAlexW4283749195MaRDI QIDQ5097778

No author found.

Publication date: 1 September 2022

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.2022.2077674

zbMATH Keywords

graphoidal covergraphoidal covering numbertruly non-trivial graphoidal cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection graphs of paths in a tree
• Graphoidal covers and graphoidal covering number of a graph
• On the graphoidal covering number of a graph
• A recognition algorithm for the intersection graphs of directed paths in directed trees
• A recognition algorithm for the intersection graphs of paths in trees
• Domination in graphoidal covers of a graph
• Graphoidal bipartite graphs
• Graphs with unique minimum graphoidal cover
• Acyclic graphoidal covers and path partitions in a graph
• Intersection graphs of vertex disjoint paths in a tree
• Intersection representations of graphs by arcs
• ON THE LABEL GRAPHOIDAL COVERING NUMBER-II
• Graphs whose acyclic graphoidal covering number is one less than its maximum degree

This page was built for publication: Truly non-trivial graphoidal graphs