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

Infinite triangulated graphs

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

DOI10.1016/0012-365X(78)90123-1zbMath0382.05047MaRDI QIDQ1247986

Stanley Wagon

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)



Mathematics Subject Classification ID

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


Related Items

Simplicial decompositions of graphs: A survey of applications ⋮ A bound on the chromatic number of graphs without certain induced subgraphs ⋮ A note on infinite triangulated graphs ⋮ Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs ⋮ A note on uncountable chordal graphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Normal hypergraphs and the perfect graph conjecture
  • On Dilworth's theorem in the infinite case
  • Infinite graphs—A survey
  • Souslin's Conjecture
  • Embedding Trees in the Rationals
  • Trees
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1247986&oldid=13335179"
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 09:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki