On chromatic uniqueness of some complete tripartite graphs

DOI10.15826/UMJ.2021.1.004zbMATH Open1473.05088OpenAlexW3191050102MaRDI QIDQ5155573FDOQ5155573

Authors: Pavel A. Gein 

Publication date: 7 October 2021

Published in: Ural mathematical journal (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/umj136

Recommendations

• About chromatic uniqueness of some complete tripartite graphs
• scientific article; zbMATH DE number 1501723
• scientific article; zbMATH DE number 5926171
• Chromatic uniqueness of a number of complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs

zbMATH Keywords

chromatic polynomialcomplete multipartite graphschromatic uniquenesschromatic equivalence

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• The lattice of integer partitions
• On chromatic coefficients
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• About chromatic uniqueness of some complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs. II
• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• The search for chromatically unique graphs
• On the partition lattice of all integers
• The chromaticity of the complete \(t\)-partite graph \(K(1,p_2,\cdots,p_t)\)
• On Garlands in \(\chi\)-uniquely colorable graphs
• About chromatic uniqueness of complete tripartite graph \(K(s, s - 1, s - k)\), where \(k\geq1\) and \(s - k\geq 2\)

Cited In (16)

• Chromatic equivalence classes of complete tripartite graphs
• Chromaticity of certain tripartite graphs identified with a path
• 完全3部图K(n-k,n-3,n)色唯一性的证明
• Absolutely 3-chromatic graphs
• Title not available (Why is that?)
• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• On the chromaticity of the complete tripartite graphs \(K(n,n,n+4)\)
• Chromatic uniqueness of certain complete tripartite graphs
• Title not available (Why is that?)
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• Chromatic uniqueness of a number of complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs. II
• Color sets of tripartite graphs
• Chromatic equivalence classes of complete tripartite graphs
• Some chromatic equivalence classes of complete multipartite graphs
• About chromatic uniqueness of some complete tripartite graphs

This page was built for publication: On chromatic uniqueness of some complete tripartite graphs

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