6 citations
- Hungarian Academy of SciencesHU2 papers
- Andrássy University BudapestHU1 paper
- Arizona State UniversityUS1 paper
- Brandeis UniversityUS1 paper
- Hefei University of TechnologyCN1 paper
- Institut de Recherche en Informatique et Systèmes AléatoiresFR1 paper
- Institute for Solid State Physics and OpticsHU1 paper
- University of DebrecenHU1 paper
- University of SzegedHU1 paper
- Valparaiso UniversityUS1 paper
- Veszprémi Érseki Hittudományi FõiskolaHU1 paper
- Zhengzhou UniversityCN1 paper
Showing math.COShow all
2 papers · 1 filter
math.CO2009★ 2 cited
On the structure of graphs with path-width at most two
János Barát, Péter Hajnal, Yixun Lin +1
Nancy G. Kinnersley and Michael A. Langston has determined the excluded minors for the class of graphs with path-width at most two by computer. Their list consisted of 110 graphs.…
math.CO2004
The Cover Pebbling Number of Graphs
Betsy Crull, Tammy Cundiff, Paul Feltman +4
A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a spec…