Thematische Bibliographien / Contraction perfect graphs / Zeitschriftenartikel

Zeitschriftenartikel zum Thema „Contraction perfect graphs“

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Contraction perfect graphs.
Autor: Grafiati
Veröffentlicht am 24. August 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-15 Zeitschriftenartikel für die Forschung zum Thema "Contraction perfect graphs" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Diner, Öznur Yaşar, Daniël Paulusma, Christophe Picouleau und Bernard Ries. „Contraction and deletion blockers for perfect graphs and H-free graphs“. Theoretical Computer Science 746 (Oktober 2018): 49–72. http://dx.doi.org/10.1016/j.tcs.2018.06.023.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Bertschi, Marc E. „Perfectly contractile graphs“. Journal of Combinatorial Theory, Series B 50, Nr. 2 (Dezember 1990): 222–30. http://dx.doi.org/10.1016/0095-8956(90)90077-d.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Maffray, Frédéric, und Nicolas Trotignon. „Algorithms for Perfectly Contractile Graphs“. SIAM Journal on Discrete Mathematics 19, Nr. 3 (Januar 2005): 553–74. http://dx.doi.org/10.1137/s0895480104442522.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Sales, Cláudia Linhares, Frédéric Maffray und Bruce Reed. „On Planar Perfectly Contractile Graphs“. Graphs and Combinatorics 13, Nr. 2 (Juni 1997): 167–87. http://dx.doi.org/10.1007/bf03352994.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Rusu, Irena. „Perfectly contractile diamond-free graphs“. Journal of Graph Theory 32, Nr. 4 (Dezember 1999): 359–89. http://dx.doi.org/10.1002/(sici)1097-0118(199912)32:4<359::aid-jgt5>3.0.co;2-u.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Sales, Cláudia Linhares, und Frédéric Maffray. „On dart-free perfectly contractile graphs“. Theoretical Computer Science 321, Nr. 2-3 (August 2004): 171–94. http://dx.doi.org/10.1016/j.tcs.2003.11.026.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Lévêque, Benjamin, und Frédéric Maffray. „Coloring Bull-Free Perfectly Contractile Graphs“. SIAM Journal on Discrete Mathematics 21, Nr. 4 (Januar 2008): 999–1018. http://dx.doi.org/10.1137/06065948x.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Maffray, Frédéric, und Nicolas Trotignon. „A class of perfectly contractile graphs“. Journal of Combinatorial Theory, Series B 96, Nr. 1 (Januar 2006): 1–19. http://dx.doi.org/10.1016/j.jctb.2005.06.011.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

PANDA, SWARUP. „Inverses of bicyclic graphs“. Electronic Journal of Linear Algebra 32 (06.02.2017): 217–31. http://dx.doi.org/10.13001/1081-3810.3322.

Der volle Inhalt der Quelle
Annotation:
A graph G is said to be nonsingular (resp., singular) if its adjacency matrix A(G) is nonsingular (resp., singular). The inverse of a nonsingular graph G is the unique weighted graph whose adjacency matrix is similar to the inverse of the adjacency matrix A(G) via a diagonal matrix of ±1s. Consider connected bipartite graphs with unique perfect matchings such that the graph obtained by contracting all matching edges is also bipartite. In [C.D. Godsil. Inverses of trees. Combinatorica, 5(1):33–39, 1985.], Godsil proved that such graphs are invertible. He posed the question of characterizing the bipartite graphs with unique perfect matchings possessing inverses. In this article, Godsil’s question for the class of bicyclic graphs is answered.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Fischer, Ilse, und C. H. C. Little. „Even Circuits of Prescribed Clockwise Parity“. Electronic Journal of Combinatorics 10, Nr. 1 (24.11.2003). http://dx.doi.org/10.37236/1738.

Der volle Inhalt der Quelle
Annotation:
We show that a graph has an orientation under which every circuit of even length is clockwise odd if and only if the graph contains no subgraph which is, after the contraction of at most one circuit of odd length, an even subdivision of $K_{2,3}$. In fact we give a more general characterisation of graphs that have an orientation under which every even circuit has a prescribed clockwise parity. Moreover we show that this characterisation has an equivalent analogue for signed graphs. We were motivated to study the original problem by our work on Pfaffian graphs, which are the graphs that have an orientation under which every alternating circuit is clockwise odd. Their significance is that they are precisely the graphs to which Kasteleyn's powerful method for enumerating perfect matchings may be applied.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
11

Li, Zhongyang. „Limit Shape of Perfect Matchings on Contracting Bipartite Graphs“. International Mathematics Research Notices, 10.03.2021. http://dx.doi.org/10.1093/imrn/rnab005.

Der volle Inhalt der Quelle
Annotation:
Abstract We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling limit. The results can also be applied to prove the existence of multiple disconnected liquid regions for all the contracting square-hexagon lattices with certain edge weights, extending the results proved in [ 13] for contracting square-hexagon lattices where the number of square rows in each period is either 0 or 1.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
12

Bachtler, Oliver, und Sven O. Krumke. „Towards Obtaining a 3-Decomposition From a Perfect Matching“. Electronic Journal of Combinatorics 29, Nr. 4 (04.11.2022). http://dx.doi.org/10.37236/11128.

Der volle Inhalt der Quelle
Annotation:
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph, and a matching. It has been settled for special classes of graphs, one of the first results being for Hamiltonian graphs. In the past two years several new results have been obtained, adding the classes of plane, claw-free, and 3-connected tree-width 3 graphs to the list. In this paper, we regard a natural extension of Hamiltonian graphs: removing a Hamiltonian cycle from a cubic graph leaves a perfect matching. Conversely, removing a perfect matching $M$ from a cubic graph $G$ leaves a disjoint union of cycles. Contracting these cycles yields a new graph $G_M$. The graph $G$ is star-like if $G_M$ is a star for some perfect matching $M$, making Hamiltonian graphs star-like. We extend the technique used to prove that Hamiltonian graphs satisfy the 3-decomposition conjecture to show that 3-connected star-like graphs satisfy it as well.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
13

SALES, C. „On dart-free perfectly contractile graphs*1“. Theoretical Computer Science, Mai 2004. http://dx.doi.org/10.1016/s0304-3975(03)00645-5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
14

Ohsugi, Hidefumi, Kazuki Shibata und Akiyoshi Tsuchiya. „Perfectly contractile graphs and quadratic toric rings“. Bulletin of the London Mathematical Society, 29.12.2022. http://dx.doi.org/10.1112/blms.12789.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
15

Nurlaelah, Nurlaelah, Basit Al Hanif und Otti Ilham Khair. „Application of Islamic Religious Values on Construction Workers (Case Study: Pt. Alcos Graha Jaya)“. Engineering and Technology Journal 09, Nr. 07 (25.07.2024). http://dx.doi.org/10.47191/etj/v9i07.12.

Der volle Inhalt der Quelle
Annotation:
Workers in a construction company are a very important element for the whole company. Therefore, the presence of workers who have high enthusiasm and outstanding achievements in their fields is very important, so that they can create optimal performance. Workers who are able to provide good performance will have a positive impact and produce high-quality work. To achieve this goal, there are several factors that support, one of which is applying religious values, especially in the Islamic context to construction work. By using the questionnaire method given to construction workers at PT ALCOS GRAHA JAYA, regression results were obtained with a t value of 11.290 greater than t table 2.00958, while the correlation result is 0.850 which means that there is a perfect correlation between the application of Islamic values and the performance of construction workers in the contractor company.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie