Note on p-competition graphs of spiders

DOI10.1142/S1793830918500842zbMATH Open1404.05071OpenAlexW2899846158WikidataQ128908610 ScholiaQ128908610MaRDI QIDQ4644796FDOQ4644796

Authors: Kyohei Nakada, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya 

Publication date: 9 January 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500842

Recommendations

• \(p\)-competition graphs
• \(p\)-competition numbers
• Note on \(p\)-competition graphs and paths
• Note on \(p\)-competition graphs of double stars
• On \(p\)-competition graphs of loopless Hamiltonian digraphs without symmetric arcs and graph operations

zbMATH Keywords

treespider\(p\)-competition graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)

Cites Work

• Topics in Intersection Graph Theory
• \(p\)-competition graphs
• On strict-double-bound numbers of spiders and ladders
• Cycles and p-competition graphs
• Note on \(p\)-competition graphs of double stars

Cited In (3)

• Title not available (Why is that?)
• Note on \(p\)-competition graphs of double stars
• On \(p\)-competition graphs of loopless Hamiltonian digraphs without symmetric arcs and graph operations

This page was built for publication: Note on \(p\)-competition graphs of spiders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644796)