Anti-Ramsey numbers of spanning double stars.
Montágh, Balázs (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Displaying similar documents to “Strong Chromatic Index Of Planar Graphs With Large Girth”
Anti-Ramsey numbers of spanning double stars.
Degree-constrained edge partitioning in graphs arising from discrete tomography.
Bentz, Cedric, Costa, Marie-Christine, Picouleau, Christophe, Ries, Bernard, De Werra, Dominique (2009)
Journal of Graph Algorithms and Applications
Similarity:
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.
Cabello, Sergio (2006)
Journal of Graph Algorithms and Applications
Similarity:
Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on -colorings of graphs.
Sheng, Jian-Ting, Liu, Gui-Zhen (2011)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Orthogonal vector coloring.
Haynes, Gerald, Park, Catherine, Schaeffer, Amanda, Webster, Jordan, Mitchell, Lon H. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Barycentric Ramsey numbers for small graphs.
González, Samuel, González, Leida, Ordaz, Oscar (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Two linear time algorithms for MST on minor closed graph classes
Martin Mareš (2004)
Archivum Mathematicum
Similarity:
This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in time for any non-trivial class of graphs closed on graph minors. This applies in particular to planar graphs and graphs of bounded genus. Both algorithms run on a pointer machine and they require no a priori knowledge of the structure of the class except for its density. Edge weights are only compared.