Anti-Ramsey numbers of spanning double stars.
Montágh, Balázs (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Displaying similar documents to “Degree-constrained edge partitioning in graphs arising from discrete tomography.”
Anti-Ramsey numbers of spanning double stars.
Cordial deficiency.
Riskin, Adrian (2007)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Algorithm engineering for optimal graph bipartization.
Hüffner, Falk (2009)
Journal of Graph Algorithms and Applications
Similarity:
Cyclic connectivity classes of directed graphs.
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
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:
Relating different cycle spaces of the same infinite graph.
Richter, R. Bruce, Rooney, Brendan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
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:
Orthogonal vector coloring.
Haynes, Gerald, Park, Catherine, Schaeffer, Amanda, Webster, Jordan, Mitchell, Lon H. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Deciding soccer scores and partial orientations of graphs.
Pálvölgyi, Dömötör (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Combinatorial aspects of an exact sequence that is related to a graphs.
Hofmeister, M. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: