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

inequalitiespartially ordered setvertex colouringcovering graphgood colouring

Mathematics Subject Classification ID

Partial orders, general (06A06) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (18)

On reorienting graphs by pushing down maximal vertices ⋮ Inversions, cuts, and orientations ⋮ A non-covering graph of girth six ⋮ Word-Representable Graphs: a Survey ⋮ On homomorphisms of oriented graphs with respect to the push operation ⋮ On oriented cliques with respect to push operation ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ On reorienting graphs by pushing down maximal vertices. II ⋮ Diagrams, orientations, and varieties ⋮ Pushable chromatic number of graphs with degree constraints ⋮ Balanced graphs and noncovering graphs ⋮ Non-cover generalized Mycielski, Kneser, and Schrijver graphs ⋮ Full orientability of graphs with at most one dependent arc ⋮ An Ore-type condition for cyclability ⋮ Neighborhood unions and cyclability of graphs ⋮ Full Orientability of Graphs ⋮ Characterization of simple edge-firing games. ⋮ On the complexity of diagram testing

Cites Work

• 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
• Unoriented graphs of modular 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

This page was built for publication: On graphs that can be oriented as diagrams of ordered sets