Simple graphs as simplicial complexes: the Mycielskian of a graph

DOI10.2478/V10037-012-0019-8zbMATH Open1292.05116OpenAlexW2021186992MaRDI QIDQ2852152FDOQ2852152

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

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

zbMATH Keywords

chromatic numberclique numberMycielskian

Mathematics Subject Classification ID

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

Cites Work

• Sur le coloriage des graphs
• Semantics of MML query -- ordering
• Title not available (Why is that?)
• The Mycielskian of a graph

Cited In (2)

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

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)