On graphs that can be oriented as diagrams of ordered sets

DOI10.1007/BF00337921zbMath0571.05041MaRDI QIDQ1061751

Oliver Pretzel

Publication date: 1985

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

inequalities; partially ordered set; vertex colouring; covering graph; good colouring

Mathematics Subject Classification ID

06A06: Partial orders, general

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

Related Items

An Ore-type condition for cyclability, Diagrams, orientations, and varieties, Non-cover generalized Mycielski, Kneser, and Schrijver graphs, On reorienting graphs by pushing down maximal vertices, A non-covering graph of girth six, Balanced graphs and noncovering graphs, On the complexity of diagram testing, On reorienting graphs by pushing down maximal vertices. II, Neighborhood unions and cyclability of graphs, Characterization of simple edge-firing games., Inversions, cuts, and orientations

Cites Work

• Unnamed Item
• Path length in the covering graph of a lattice
• Colouring lattices
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Graphs Orientable as Distributive Lattices
• On chromatic number of graphs and set-systems
• Undirected Graphs Realizable as Graphs of Modular Lattices
• A Note on Undirected Graphs Realizable as P.O. Sets