Triameter of graphs (Q2227115)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Triameter of graphs	scientific article

Statements

scholarly article

0 references

Triameter of graphs (English)

0 references

0 references

Discussiones Mathematicae. Graph Theory

0 references

publication date

10 February 2021

0 references

full work available at URL

https://arxiv.org/abs/1804.01088

0 references

zbMATH Keywords

distance

0 references

radio \(k\)-coloring

0 references

Nordhaus-Gaddum bounds

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

A table of connected graphs on six vertices

0 references

On Hadwiger's Number and the Stability Number

0 references

0 references

0 references

A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture

0 references

0 references

Graphic vertices of the metric polytope

0 references

Antipodal number of some powers of cycles

0 references

A lower bound for radio \(k\)-chromatic number

0 references

On characterizing radio \(k\)-coloring problem by path covering problem

0 references

On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span

0 references

Neural ideals in SageMath

0 references

Identifiers

zbMATH Open document ID

0 references

10.7151/dmgt.2212

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2227115

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2227115&oldid=36652652"