Abstract
Let H = ( X , E ) be a simple hypergraph and let f ( H , λ ) denote its chromatic polynomial. Two hypergraphs H 1 and H 2 are chromatic equivalent if f ( H 1 , λ ) = f ( H 2 , λ ) . The equivalence class of H is denoted by 〈 H 〉 . Let K and H be two classes of hypergraphs. H is said to be chromatically characterized in K if for every H ∈ H ∩ K we have 〈 H 〉 ∩ K = H ∩ K . In this paper we prove that uniform hypertrees and uniform unicyclic hypergraphs are chromatically characterized in the class of linear hypergraphs.
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.
