Simple graphs as simplicial complexes: the Mycielskian of a graph

DOI10.2478/V10037-012-0019-8MaRDI QIDQ2852152zbMATH OpenOpenAlexFDO

Authors Piotr Rudnicki, Lorna Stewart

Publication date 8 October 2013

Published in Formalized Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2478/v10037-012-0019-8

zbMATH Keywords

chromatic numberclique numberMycielskian

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of simplicial complexes (05E45)

Recommendations

• The Mycielskian of a graph
• A Simple Construction to Prove Mycielski’s Theorem
• Mycielskians and matchings
• Connectivity of the Mycielskian of a graph
• Color stable graphs

Cites work

• scientific article; zbMATH DE number 3001191 (Why is no real title available?)
• Semantics of MML query -- ordering
• Sur le coloriage des graphs
• The Mycielskian of a graph

Cited in

(2)

• Underlying simple graphs
• ATP and presentation service for Mizar formalizations

Describes a project that uses

Uses Software

• Mizar

This page was built for publication: Simple graphs as simplicial complexes: the Mycielskian of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852152)