Abstract
Abstract Let L 3 l be the class of edge intersection graphs of linear 3-uniform hypergraphs. The problem of recognizing G ∈ L 3 l is NP-complete. Denote by δ ALG the minimal integer such that the problem G ∈ L 3 l is polynomially solvable in the class of graphs G with the minimal vertex degree δ ( G ) ≥ δ ALG and by δ FIS the minimal integer such that L 3 l can be characterized by a finite list of forbidden induced subgraphs in the class of graphs G with δ ( G ) ≥ δ FIS . It is proved that δ ALG ≤ 10 and δ FIS ≤ 16 .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
