Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Nombre chromatique total d'un hypergraphe

From MaRDI portal
Publication:1219307
Jump to:navigation, search

DOI10.1016/0095-8956(78)90075-8zbMath0311.05139OpenAlexW2011685078MaRDI QIDQ1219307

S. Singh

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90075-8



Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)


Related Items (3)

The total graph of a hypergraph ⋮ Integer sequences without singleton intersection ⋮ Strong total chromatic numbers of complete hypergraphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Nombre chromatique total du joint d'un ensemble stable par un cycle
  • Nombre Chromatique Total Du Graphe R -Parti Complet
  • The Colour Numbers of Complete Graphs


This page was built for publication: Nombre chromatique total d'un hypergraphe

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1219307&oldid=13294649"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 07:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki